./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-5.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/unroll-cond-5.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 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:34:28,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:34:28,902 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:34:28,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:34:28,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:34:28,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:34:28,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:34:28,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:34:28,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:34:28,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:34:28,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:34:28,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:34:28,947 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:34:28,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:34:28,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:34:28,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:34:28,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:34:28,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:28,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:34:28,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:28,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:28,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:28,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:34:28,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:34:28,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:34:28,951 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2025-01-09 21:34:29,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:34:29,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:34:29,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:34:29,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:34:29,230 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:34:29,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-01-09 21:34:30,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6803657d6/541913260ea24dd8876e6bdd14818d46/FLAG3a2c720db [2025-01-09 21:34:30,728 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:34:30,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-01-09 21:34:30,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6803657d6/541913260ea24dd8876e6bdd14818d46/FLAG3a2c720db [2025-01-09 21:34:30,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6803657d6/541913260ea24dd8876e6bdd14818d46 [2025-01-09 21:34:30,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:34:30,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:34:30,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:30,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:34:30,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:34:30,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:30" (1/1) ... [2025-01-09 21:34:30,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b5d94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:30, skipping insertion in model container [2025-01-09 21:34:30,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:30" (1/1) ... [2025-01-09 21:34:30,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:34:30,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:30,999 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:34:31,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:31,066 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:34:31,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31 WrapperNode [2025-01-09 21:34:31,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:31,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:31,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:34:31,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:34:31,074 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:34:31" (1/1) ... [2025-01-09 21:34:31,089 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:34:31" (1/1) ... [2025-01-09 21:34:31,135 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 463 [2025-01-09 21:34:31,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:31,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:34:31,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:34:31,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:34:31,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:34:31,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:34:31,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:34:31,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:34:31,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (1/1) ... [2025-01-09 21:34:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:31,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:34:31,218 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:34:31,220 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:34:31,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:34:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:34:31,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:34:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:34:31,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:34:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:34:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:34:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:34:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:34:31,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:34:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:34:31,246 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:34:31,325 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:34:31,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:34:32,036 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:34:32,036 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:34:32,072 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:34:32,076 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:34:32,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:32 BoogieIcfgContainer [2025-01-09 21:34:32,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:34:32,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:34:32,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:34:32,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:34:32,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:34:30" (1/3) ... [2025-01-09 21:34:32,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a0cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:32, skipping insertion in model container [2025-01-09 21:34:32,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:31" (2/3) ... [2025-01-09 21:34:32,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a0cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:32, skipping insertion in model container [2025-01-09 21:34:32,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:32" (3/3) ... [2025-01-09 21:34:32,088 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2025-01-09 21:34:32,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:34:32,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-5.wvr.c that has 3 procedures, 595 locations, 1 initial locations, 3 loop locations, and 84 error locations. [2025-01-09 21:34:32,106 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:34:32,329 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:34:32,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 601 places, 627 transitions, 1268 flow [2025-01-09 21:34:32,589 INFO L124 PetriNetUnfolderBase]: 33/625 cut-off events. [2025-01-09 21:34:32,592 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:32,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 625 events. 33/625 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1826 event pairs, 0 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 500. Up to 2 conditions per place. [2025-01-09 21:34:32,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 601 places, 627 transitions, 1268 flow [2025-01-09 21:34:32,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 583 places, 608 transitions, 1228 flow [2025-01-09 21:34:32,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:34:32,652 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;@4ed8b5a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:34:32,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2025-01-09 21:34:32,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:34:32,659 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:34:32,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:34:32,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:32,661 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] [2025-01-09 21:34:32,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:32,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1293261115, now seen corresponding path program 1 times [2025-01-09 21:34:32,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567328052] [2025-01-09 21:34:32,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:32,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:32,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:34:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:34:32,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:32,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567328052] [2025-01-09 21:34:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567328052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:32,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063131456] [2025-01-09 21:34:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:32,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:32,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:32,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:32,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 627 [2025-01-09 21:34:32,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 608 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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:34:32,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:32,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 627 [2025-01-09 21:34:32,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:33,133 INFO L124 PetriNetUnfolderBase]: 40/920 cut-off events. [2025-01-09 21:34:33,134 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:34:33,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 920 events. 40/920 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4454 event pairs, 11 based on Foata normal form. 19/760 useless extension candidates. Maximal degree in co-relation 833. Up to 42 conditions per place. [2025-01-09 21:34:33,147 INFO L140 encePairwiseOnDemand]: 609/627 looper letters, 13 selfloop transitions, 2 changer transitions 3/592 dead transitions. [2025-01-09 21:34:33,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 592 transitions, 1226 flow [2025-01-09 21:34:33,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1810 transitions. [2025-01-09 21:34:33,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962254120148857 [2025-01-09 21:34:33,171 INFO L175 Difference]: Start difference. First operand has 583 places, 608 transitions, 1228 flow. Second operand 3 states and 1810 transitions. [2025-01-09 21:34:33,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 592 transitions, 1226 flow [2025-01-09 21:34:33,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1218 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:34:33,194 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1186 flow [2025-01-09 21:34:33,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=580, PETRI_TRANSITIONS=589} [2025-01-09 21:34:33,201 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -3 predicate places. [2025-01-09 21:34:33,201 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1186 flow [2025-01-09 21:34:33,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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:34:33,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:33,203 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] [2025-01-09 21:34:33,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:34:33,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:33,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1652512128, now seen corresponding path program 1 times [2025-01-09 21:34:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:33,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634413009] [2025-01-09 21:34:33,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:33,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:34:33,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:34:33,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:33,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:33,263 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:34:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634413009] [2025-01-09 21:34:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634413009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:33,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97661875] [2025-01-09 21:34:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:33,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:33,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:33,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:33,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 627 [2025-01-09 21:34:33,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 589 transitions, 1186 flow. Second operand has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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:34:33,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:33,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 627 [2025-01-09 21:34:33,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:33,510 INFO L124 PetriNetUnfolderBase]: 50/1044 cut-off events. [2025-01-09 21:34:33,510 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:34:33,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1044 events. 50/1044 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4880 event pairs, 19 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1083. Up to 58 conditions per place. [2025-01-09 21:34:33,520 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 19 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2025-01-09 21:34:33,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 588 transitions, 1226 flow [2025-01-09 21:34:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-01-09 21:34:33,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947900053163211 [2025-01-09 21:34:33,525 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1186 flow. Second operand 3 states and 1783 transitions. [2025-01-09 21:34:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 588 transitions, 1226 flow [2025-01-09 21:34:33,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 588 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:33,539 INFO L231 Difference]: Finished difference. Result has 576 places, 588 transitions, 1184 flow [2025-01-09 21:34:33,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=576, PETRI_TRANSITIONS=588} [2025-01-09 21:34:33,541 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -7 predicate places. [2025-01-09 21:34:33,541 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 588 transitions, 1184 flow [2025-01-09 21:34:33,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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:34:33,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:33,542 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:34:33,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:33,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:33,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1038808245, now seen corresponding path program 1 times [2025-01-09 21:34:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198415638] [2025-01-09 21:34:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:33,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:34:33,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:34:33,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:33,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:33,590 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:34:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198415638] [2025-01-09 21:34:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198415638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:33,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:33,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:33,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150672578] [2025-01-09 21:34:33,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:33,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:33,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:33,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:33,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:33,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 627 [2025-01-09 21:34:33,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 588 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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:34:33,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:33,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 627 [2025-01-09 21:34:33,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:34,112 INFO L124 PetriNetUnfolderBase]: 180/2417 cut-off events. [2025-01-09 21:34:34,113 INFO L125 PetriNetUnfolderBase]: For 41/42 co-relation queries the response was YES. [2025-01-09 21:34:34,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 2417 events. 180/2417 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15805 event pairs, 56 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 2588. Up to 197 conditions per place. [2025-01-09 21:34:34,143 INFO L140 encePairwiseOnDemand]: 614/627 looper letters, 28 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2025-01-09 21:34:34,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 576 transitions, 1218 flow [2025-01-09 21:34:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1748 transitions. [2025-01-09 21:34:34,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2025-01-09 21:34:34,149 INFO L175 Difference]: Start difference. First operand has 576 places, 588 transitions, 1184 flow. Second operand 3 states and 1748 transitions. [2025-01-09 21:34:34,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 576 transitions, 1218 flow [2025-01-09 21:34:34,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 576 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:34,159 INFO L231 Difference]: Finished difference. Result has 564 places, 576 transitions, 1158 flow [2025-01-09 21:34:34,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=564, PETRI_TRANSITIONS=576} [2025-01-09 21:34:34,160 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -19 predicate places. [2025-01-09 21:34:34,160 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 576 transitions, 1158 flow [2025-01-09 21:34:34,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.0) internal successors, (1710), 3 states have internal predecessors, (1710), 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:34:34,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:34,163 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:34:34,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:34,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:34,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1861843512, now seen corresponding path program 1 times [2025-01-09 21:34:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:34,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759776920] [2025-01-09 21:34:34,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:34,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:34,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:34:34,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:34:34,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:34,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:34,255 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:34:34,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759776920] [2025-01-09 21:34:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759776920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:34,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341181926] [2025-01-09 21:34:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:34,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:34,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:34,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 627 [2025-01-09 21:34:34,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 576 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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:34:34,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:34,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 627 [2025-01-09 21:34:34,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:34,505 INFO L124 PetriNetUnfolderBase]: 50/1022 cut-off events. [2025-01-09 21:34:34,505 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:34:34,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 1022 events. 50/1022 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4733 event pairs, 19 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1050. Up to 56 conditions per place. [2025-01-09 21:34:34,520 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-01-09 21:34:34,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 575 transitions, 1194 flow [2025-01-09 21:34:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2025-01-09 21:34:34,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950026581605529 [2025-01-09 21:34:34,527 INFO L175 Difference]: Start difference. First operand has 564 places, 576 transitions, 1158 flow. Second operand 3 states and 1787 transitions. [2025-01-09 21:34:34,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 575 transitions, 1194 flow [2025-01-09 21:34:34,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 575 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:34,540 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1159 flow [2025-01-09 21:34:34,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=564, PETRI_TRANSITIONS=575} [2025-01-09 21:34:34,544 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -19 predicate places. [2025-01-09 21:34:34,545 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1159 flow [2025-01-09 21:34:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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:34:34,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:34,546 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:34:34,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:34,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:34,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1160970502, now seen corresponding path program 1 times [2025-01-09 21:34:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686286654] [2025-01-09 21:34:34,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:34,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:34:34,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:34:34,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:34,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:35,300 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:34:35,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686286654] [2025-01-09 21:34:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686286654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30276109] [2025-01-09 21:34:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:35,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:35,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 627 [2025-01-09 21:34:35,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 575 transitions, 1159 flow. Second operand has 6 states, 6 states have (on average 553.5) internal successors, (3321), 6 states have internal predecessors, (3321), 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:34:35,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:35,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 627 [2025-01-09 21:34:35,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:36,134 INFO L124 PetriNetUnfolderBase]: 368/3207 cut-off events. [2025-01-09 21:34:36,135 INFO L125 PetriNetUnfolderBase]: For 76/77 co-relation queries the response was YES. [2025-01-09 21:34:36,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 3207 events. 368/3207 cut-off events. For 76/77 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 22803 event pairs, 184 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3704. Up to 516 conditions per place. [2025-01-09 21:34:36,161 INFO L140 encePairwiseOnDemand]: 621/627 looper letters, 52 selfloop transitions, 5 changer transitions 0/574 dead transitions. [2025-01-09 21:34:36,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1271 flow [2025-01-09 21:34:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3370 transitions. [2025-01-09 21:34:36,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958001063264222 [2025-01-09 21:34:36,170 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1159 flow. Second operand 6 states and 3370 transitions. [2025-01-09 21:34:36,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1271 flow [2025-01-09 21:34:36,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 574 transitions, 1267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:36,181 INFO L231 Difference]: Finished difference. Result has 566 places, 574 transitions, 1163 flow [2025-01-09 21:34:36,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=566, PETRI_TRANSITIONS=574} [2025-01-09 21:34:36,183 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -17 predicate places. [2025-01-09 21:34:36,183 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 574 transitions, 1163 flow [2025-01-09 21:34:36,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 553.5) internal successors, (3321), 6 states have internal predecessors, (3321), 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:34:36,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:36,185 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] [2025-01-09 21:34:36,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:36,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1989811538, now seen corresponding path program 1 times [2025-01-09 21:34:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841081046] [2025-01-09 21:34:36,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:36,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:34:36,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:34:36,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:36,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:36,230 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:34:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841081046] [2025-01-09 21:34:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841081046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218346556] [2025-01-09 21:34:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:36,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:36,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:36,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:36,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 627 [2025-01-09 21:34:36,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 574 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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:34:36,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:36,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 627 [2025-01-09 21:34:36,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:36,468 INFO L124 PetriNetUnfolderBase]: 104/1939 cut-off events. [2025-01-09 21:34:36,469 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 21:34:36,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1939 events. 104/1939 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 12247 event pairs, 20 based on Foata normal form. 0/1591 useless extension candidates. Maximal degree in co-relation 2031. Up to 94 conditions per place. [2025-01-09 21:34:36,482 INFO L140 encePairwiseOnDemand]: 619/627 looper letters, 18 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-01-09 21:34:36,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1198 flow [2025-01-09 21:34:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2025-01-09 21:34:36,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950026581605529 [2025-01-09 21:34:36,487 INFO L175 Difference]: Start difference. First operand has 566 places, 574 transitions, 1163 flow. Second operand 3 states and 1787 transitions. [2025-01-09 21:34:36,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1198 flow [2025-01-09 21:34:36,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 571 transitions, 1188 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:36,499 INFO L231 Difference]: Finished difference. Result has 558 places, 570 transitions, 1155 flow [2025-01-09 21:34:36,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1155, PETRI_PLACES=558, PETRI_TRANSITIONS=570} [2025-01-09 21:34:36,503 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -25 predicate places. [2025-01-09 21:34:36,503 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 570 transitions, 1155 flow [2025-01-09 21:34:36,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 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:34:36,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:36,505 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] [2025-01-09 21:34:36,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:36,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:36,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash -661674750, now seen corresponding path program 1 times [2025-01-09 21:34:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:36,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481490019] [2025-01-09 21:34:36,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:36,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:34:36,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:34:36,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:36,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:36,557 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:34:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481490019] [2025-01-09 21:34:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481490019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469449464] [2025-01-09 21:34:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:36,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:36,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:36,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:36,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 627 [2025-01-09 21:34:36,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 570 transitions, 1155 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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:34:36,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:36,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 627 [2025-01-09 21:34:36,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:36,692 INFO L124 PetriNetUnfolderBase]: 44/1034 cut-off events. [2025-01-09 21:34:36,692 INFO L125 PetriNetUnfolderBase]: For 3/10 co-relation queries the response was YES. [2025-01-09 21:34:36,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 1034 events. 44/1034 cut-off events. For 3/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4663 event pairs, 1 based on Foata normal form. 1/867 useless extension candidates. Maximal degree in co-relation 1053. Up to 21 conditions per place. [2025-01-09 21:34:36,701 INFO L140 encePairwiseOnDemand]: 620/627 looper letters, 11 selfloop transitions, 3 changer transitions 0/567 dead transitions. [2025-01-09 21:34:36,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 567 transitions, 1178 flow [2025-01-09 21:34:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2025-01-09 21:34:36,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553429027113237 [2025-01-09 21:34:36,705 INFO L175 Difference]: Start difference. First operand has 558 places, 570 transitions, 1155 flow. Second operand 3 states and 1797 transitions. [2025-01-09 21:34:36,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 567 transitions, 1178 flow [2025-01-09 21:34:36,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 567 transitions, 1178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:36,713 INFO L231 Difference]: Finished difference. Result has 556 places, 566 transitions, 1153 flow [2025-01-09 21:34:36,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=556, PETRI_TRANSITIONS=566} [2025-01-09 21:34:36,716 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -27 predicate places. [2025-01-09 21:34:36,716 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 566 transitions, 1153 flow [2025-01-09 21:34:36,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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:34:36,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:36,717 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] [2025-01-09 21:34:36,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:36,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:36,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash -725255351, now seen corresponding path program 1 times [2025-01-09 21:34:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:36,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834426743] [2025-01-09 21:34:36,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:36,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:34:36,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:34:36,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:36,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:36,773 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:34:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:36,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834426743] [2025-01-09 21:34:36,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834426743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:36,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:36,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722640975] [2025-01-09 21:34:36,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:36,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:36,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:36,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:36,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 627 [2025-01-09 21:34:36,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 566 transitions, 1153 flow. Second operand has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 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:34:36,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:36,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 627 [2025-01-09 21:34:36,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:37,077 INFO L124 PetriNetUnfolderBase]: 105/1283 cut-off events. [2025-01-09 21:34:37,077 INFO L125 PetriNetUnfolderBase]: For 65/66 co-relation queries the response was YES. [2025-01-09 21:34:37,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 1283 events. 105/1283 cut-off events. For 65/66 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7039 event pairs, 9 based on Foata normal form. 1/1136 useless extension candidates. Maximal degree in co-relation 1524. Up to 217 conditions per place. [2025-01-09 21:34:37,087 INFO L140 encePairwiseOnDemand]: 580/627 looper letters, 49 selfloop transitions, 18 changer transitions 4/539 dead transitions. [2025-01-09 21:34:37,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 539 transitions, 1238 flow [2025-01-09 21:34:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1636 transitions. [2025-01-09 21:34:37,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8697501329080276 [2025-01-09 21:34:37,092 INFO L175 Difference]: Start difference. First operand has 556 places, 566 transitions, 1153 flow. Second operand 3 states and 1636 transitions. [2025-01-09 21:34:37,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 539 transitions, 1238 flow [2025-01-09 21:34:37,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 539 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:37,100 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1118 flow [2025-01-09 21:34:37,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2025-01-09 21:34:37,101 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -55 predicate places. [2025-01-09 21:34:37,101 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1118 flow [2025-01-09 21:34:37,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 514.3333333333334) internal successors, (1543), 3 states have internal predecessors, (1543), 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:34:37,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:37,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:37,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:37,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:37,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -261198081, now seen corresponding path program 1 times [2025-01-09 21:34:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195778107] [2025-01-09 21:34:37,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:37,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:34:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:34:37,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:37,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:37,149 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:34:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195778107] [2025-01-09 21:34:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195778107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086033493] [2025-01-09 21:34:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:37,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:37,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:37,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:37,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 627 [2025-01-09 21:34:37,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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:34:37,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:37,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 627 [2025-01-09 21:34:37,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:37,438 INFO L124 PetriNetUnfolderBase]: 174/2498 cut-off events. [2025-01-09 21:34:37,438 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:34:37,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2498 events. 174/2498 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 16816 event pairs, 19 based on Foata normal form. 0/2225 useless extension candidates. Maximal degree in co-relation 2777. Up to 180 conditions per place. [2025-01-09 21:34:37,457 INFO L140 encePairwiseOnDemand]: 611/627 looper letters, 26 selfloop transitions, 6 changer transitions 0/532 dead transitions. [2025-01-09 21:34:37,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 532 transitions, 1180 flow [2025-01-09 21:34:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1767 transitions. [2025-01-09 21:34:37,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-01-09 21:34:37,462 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1118 flow. Second operand 3 states and 1767 transitions. [2025-01-09 21:34:37,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 532 transitions, 1180 flow [2025-01-09 21:34:37,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 532 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:37,472 INFO L231 Difference]: Finished difference. Result has 515 places, 530 transitions, 1104 flow [2025-01-09 21:34:37,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=515, PETRI_TRANSITIONS=530} [2025-01-09 21:34:37,474 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -68 predicate places. [2025-01-09 21:34:37,474 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 530 transitions, 1104 flow [2025-01-09 21:34:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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:34:37,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:37,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:37,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:34:37,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:37,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 55714341, now seen corresponding path program 1 times [2025-01-09 21:34:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:37,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133222299] [2025-01-09 21:34:37,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:37,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:34:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:34:37,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:37,597 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:34:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133222299] [2025-01-09 21:34:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133222299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24364804] [2025-01-09 21:34:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:37,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:37,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:37,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 627 [2025-01-09 21:34:37,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 530 transitions, 1104 flow. Second operand has 4 states, 4 states have (on average 600.25) internal successors, (2401), 4 states have internal predecessors, (2401), 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:34:37,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:37,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 627 [2025-01-09 21:34:37,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:38,008 INFO L124 PetriNetUnfolderBase]: 157/3092 cut-off events. [2025-01-09 21:34:38,009 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:38,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 3092 events. 157/3092 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 21465 event pairs, 8 based on Foata normal form. 0/2753 useless extension candidates. Maximal degree in co-relation 3231. Up to 73 conditions per place. [2025-01-09 21:34:38,023 INFO L140 encePairwiseOnDemand]: 621/627 looper letters, 13 selfloop transitions, 6 changer transitions 0/539 dead transitions. [2025-01-09 21:34:38,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 539 transitions, 1164 flow [2025-01-09 21:34:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3015 transitions. [2025-01-09 21:34:38,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9617224880382775 [2025-01-09 21:34:38,029 INFO L175 Difference]: Start difference. First operand has 515 places, 530 transitions, 1104 flow. Second operand 5 states and 3015 transitions. [2025-01-09 21:34:38,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 539 transitions, 1164 flow [2025-01-09 21:34:38,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 539 transitions, 1164 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:38,037 INFO L231 Difference]: Finished difference. Result has 522 places, 534 transitions, 1142 flow [2025-01-09 21:34:38,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1142, PETRI_PLACES=522, PETRI_TRANSITIONS=534} [2025-01-09 21:34:38,038 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -61 predicate places. [2025-01-09 21:34:38,038 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 534 transitions, 1142 flow [2025-01-09 21:34:38,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 600.25) internal successors, (2401), 4 states have internal predecessors, (2401), 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:34:38,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:38,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:38,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:34:38,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:38,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 152608269, now seen corresponding path program 1 times [2025-01-09 21:34:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940416574] [2025-01-09 21:34:38,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:38,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:34:38,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:34:38,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:38,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:38,411 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:34:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:38,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940416574] [2025-01-09 21:34:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940416574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:38,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189977703] [2025-01-09 21:34:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:38,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:38,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:38,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:38,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 627 [2025-01-09 21:34:38,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 534 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 593.5) internal successors, (3561), 6 states have internal predecessors, (3561), 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:34:38,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:38,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 627 [2025-01-09 21:34:38,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:39,206 INFO L124 PetriNetUnfolderBase]: 125/2383 cut-off events. [2025-01-09 21:34:39,206 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:34:39,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 2383 events. 125/2383 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 15043 event pairs, 7 based on Foata normal form. 0/2135 useless extension candidates. Maximal degree in co-relation 2543. Up to 57 conditions per place. [2025-01-09 21:34:39,223 INFO L140 encePairwiseOnDemand]: 621/627 looper letters, 15 selfloop transitions, 6 changer transitions 0/537 dead transitions. [2025-01-09 21:34:39,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 537 transitions, 1194 flow [2025-01-09 21:34:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3573 transitions. [2025-01-09 21:34:39,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497607655502392 [2025-01-09 21:34:39,231 INFO L175 Difference]: Start difference. First operand has 522 places, 534 transitions, 1142 flow. Second operand 6 states and 3573 transitions. [2025-01-09 21:34:39,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 537 transitions, 1194 flow [2025-01-09 21:34:39,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 537 transitions, 1194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:39,241 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1152 flow [2025-01-09 21:34:39,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1152, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2025-01-09 21:34:39,243 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -57 predicate places. [2025-01-09 21:34:39,243 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1152 flow [2025-01-09 21:34:39,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 593.5) internal successors, (3561), 6 states have internal predecessors, (3561), 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:34:39,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:39,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:39,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:34:39,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1414039386, now seen corresponding path program 1 times [2025-01-09 21:34:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116093123] [2025-01-09 21:34:39,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:39,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:39,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:34:39,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:34:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:39,348 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:34:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116093123] [2025-01-09 21:34:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116093123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:39,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:39,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:39,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541358501] [2025-01-09 21:34:39,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:39,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:39,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:39,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:39,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 627 [2025-01-09 21:34:39,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1152 flow. Second operand has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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:34:39,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:39,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 627 [2025-01-09 21:34:39,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:39,904 INFO L124 PetriNetUnfolderBase]: 192/3289 cut-off events. [2025-01-09 21:34:39,905 INFO L125 PetriNetUnfolderBase]: For 54/55 co-relation queries the response was YES. [2025-01-09 21:34:39,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 3289 events. 192/3289 cut-off events. For 54/55 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 22078 event pairs, 16 based on Foata normal form. 0/2942 useless extension candidates. Maximal degree in co-relation 3636. Up to 133 conditions per place. [2025-01-09 21:34:39,923 INFO L140 encePairwiseOnDemand]: 617/627 looper letters, 20 selfloop transitions, 10 changer transitions 0/545 dead transitions. [2025-01-09 21:34:39,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 545 transitions, 1239 flow [2025-01-09 21:34:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2986 transitions. [2025-01-09 21:34:39,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524720893141946 [2025-01-09 21:34:39,929 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1152 flow. Second operand 5 states and 2986 transitions. [2025-01-09 21:34:39,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 545 transitions, 1239 flow [2025-01-09 21:34:39,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 545 transitions, 1227 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:39,938 INFO L231 Difference]: Finished difference. Result has 528 places, 541 transitions, 1210 flow [2025-01-09 21:34:39,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1210, PETRI_PLACES=528, PETRI_TRANSITIONS=541} [2025-01-09 21:34:39,940 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -55 predicate places. [2025-01-09 21:34:39,941 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 541 transitions, 1210 flow [2025-01-09 21:34:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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:34:39,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:39,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:34:39,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -712700802, now seen corresponding path program 1 times [2025-01-09 21:34:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363510834] [2025-01-09 21:34:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:39,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:34:39,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:34:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:39,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:40,044 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:34:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363510834] [2025-01-09 21:34:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363510834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410913562] [2025-01-09 21:34:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:40,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:40,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:40,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:40,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 627 [2025-01-09 21:34:40,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 541 transitions, 1210 flow. Second operand has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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:34:40,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:40,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 627 [2025-01-09 21:34:40,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:40,695 INFO L124 PetriNetUnfolderBase]: 189/3286 cut-off events. [2025-01-09 21:34:40,695 INFO L125 PetriNetUnfolderBase]: For 176/177 co-relation queries the response was YES. [2025-01-09 21:34:40,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 3286 events. 189/3286 cut-off events. For 176/177 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 22157 event pairs, 16 based on Foata normal form. 0/2948 useless extension candidates. Maximal degree in co-relation 3708. Up to 133 conditions per place. [2025-01-09 21:34:40,714 INFO L140 encePairwiseOnDemand]: 617/627 looper letters, 20 selfloop transitions, 10 changer transitions 0/548 dead transitions. [2025-01-09 21:34:40,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 548 transitions, 1287 flow [2025-01-09 21:34:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2986 transitions. [2025-01-09 21:34:40,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524720893141946 [2025-01-09 21:34:40,721 INFO L175 Difference]: Start difference. First operand has 528 places, 541 transitions, 1210 flow. Second operand 5 states and 2986 transitions. [2025-01-09 21:34:40,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 548 transitions, 1287 flow [2025-01-09 21:34:40,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 548 transitions, 1287 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:40,731 INFO L231 Difference]: Finished difference. Result has 535 places, 544 transitions, 1260 flow [2025-01-09 21:34:40,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1260, PETRI_PLACES=535, PETRI_TRANSITIONS=544} [2025-01-09 21:34:40,734 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -48 predicate places. [2025-01-09 21:34:40,734 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 544 transitions, 1260 flow [2025-01-09 21:34:40,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 592.5) internal successors, (2370), 4 states have internal predecessors, (2370), 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:34:40,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:40,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:40,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:34:40,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:40,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1929382224, now seen corresponding path program 1 times [2025-01-09 21:34:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256228594] [2025-01-09 21:34:40,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:40,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:34:40,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:34:40,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:40,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:40,788 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:34:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256228594] [2025-01-09 21:34:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256228594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:40,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:40,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76039062] [2025-01-09 21:34:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:40,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:40,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:40,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:40,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 627 [2025-01-09 21:34:40,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 544 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 599.3333333333334) internal successors, (1798), 3 states have internal predecessors, (1798), 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:34:40,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:40,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 627 [2025-01-09 21:34:40,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:41,116 INFO L124 PetriNetUnfolderBase]: 131/2550 cut-off events. [2025-01-09 21:34:41,116 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-01-09 21:34:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 2550 events. 131/2550 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15608 event pairs, 20 based on Foata normal form. 0/2316 useless extension candidates. Maximal degree in co-relation 2934. Up to 74 conditions per place. [2025-01-09 21:34:41,141 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 9 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-01-09 21:34:41,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 544 transitions, 1283 flow [2025-01-09 21:34:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-01-09 21:34:41,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585326953748007 [2025-01-09 21:34:41,172 INFO L175 Difference]: Start difference. First operand has 535 places, 544 transitions, 1260 flow. Second operand 3 states and 1803 transitions. [2025-01-09 21:34:41,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 544 transitions, 1283 flow [2025-01-09 21:34:41,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 544 transitions, 1283 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:41,182 INFO L231 Difference]: Finished difference. Result has 536 places, 543 transitions, 1262 flow [2025-01-09 21:34:41,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1262, PETRI_PLACES=536, PETRI_TRANSITIONS=543} [2025-01-09 21:34:41,184 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -47 predicate places. [2025-01-09 21:34:41,184 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 543 transitions, 1262 flow [2025-01-09 21:34:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.3333333333334) internal successors, (1798), 3 states have internal predecessors, (1798), 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:34:41,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:41,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:34:41,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 706155615, now seen corresponding path program 1 times [2025-01-09 21:34:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677928876] [2025-01-09 21:34:41,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:41,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:34:41,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:34:41,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677928876] [2025-01-09 21:34:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677928876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370014707] [2025-01-09 21:34:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:41,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:41,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:42,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 627 [2025-01-09 21:34:42,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 543 transitions, 1262 flow. Second operand has 6 states, 6 states have (on average 537.6666666666666) internal successors, (3226), 6 states have internal predecessors, (3226), 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:34:42,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:42,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 627 [2025-01-09 21:34:42,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:42,598 INFO L124 PetriNetUnfolderBase]: 287/2739 cut-off events. [2025-01-09 21:34:42,599 INFO L125 PetriNetUnfolderBase]: For 375/376 co-relation queries the response was YES. [2025-01-09 21:34:42,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 2739 events. 287/2739 cut-off events. For 375/376 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 17818 event pairs, 30 based on Foata normal form. 0/2536 useless extension candidates. Maximal degree in co-relation 3755. Up to 224 conditions per place. [2025-01-09 21:34:42,624 INFO L140 encePairwiseOnDemand]: 573/627 looper letters, 23 selfloop transitions, 50 changer transitions 0/538 dead transitions. [2025-01-09 21:34:42,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 538 transitions, 1402 flow [2025-01-09 21:34:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3293 transitions. [2025-01-09 21:34:42,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8753322700691122 [2025-01-09 21:34:42,690 INFO L175 Difference]: Start difference. First operand has 536 places, 543 transitions, 1262 flow. Second operand 6 states and 3293 transitions. [2025-01-09 21:34:42,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 538 transitions, 1402 flow [2025-01-09 21:34:42,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 538 transitions, 1398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:42,699 INFO L231 Difference]: Finished difference. Result has 530 places, 534 transitions, 1340 flow [2025-01-09 21:34:42,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1340, PETRI_PLACES=530, PETRI_TRANSITIONS=534} [2025-01-09 21:34:42,701 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -53 predicate places. [2025-01-09 21:34:42,702 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 534 transitions, 1340 flow [2025-01-09 21:34:42,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 537.6666666666666) internal successors, (3226), 6 states have internal predecessors, (3226), 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:34:42,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:42,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:42,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:34:42,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1756449421, now seen corresponding path program 1 times [2025-01-09 21:34:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299489481] [2025-01-09 21:34:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:42,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:34:42,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:34:42,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:42,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:42,745 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:34:42,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299489481] [2025-01-09 21:34:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299489481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945241829] [2025-01-09 21:34:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:42,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:42,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:42,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:42,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 534 transitions, 1340 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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:34:42,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:42,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:42,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:43,288 INFO L124 PetriNetUnfolderBase]: 249/3089 cut-off events. [2025-01-09 21:34:43,288 INFO L125 PetriNetUnfolderBase]: For 381/382 co-relation queries the response was YES. [2025-01-09 21:34:43,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 3089 events. 249/3089 cut-off events. For 381/382 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20636 event pairs, 116 based on Foata normal form. 0/2841 useless extension candidates. Maximal degree in co-relation 4182. Up to 420 conditions per place. [2025-01-09 21:34:43,313 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/534 dead transitions. [2025-01-09 21:34:43,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 534 transitions, 1427 flow [2025-01-09 21:34:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:43,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:43,317 INFO L175 Difference]: Start difference. First operand has 530 places, 534 transitions, 1340 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:43,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 534 transitions, 1427 flow [2025-01-09 21:34:43,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 534 transitions, 1327 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:43,327 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1242 flow [2025-01-09 21:34:43,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2025-01-09 21:34:43,328 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -57 predicate places. [2025-01-09 21:34:43,328 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1242 flow [2025-01-09 21:34:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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:34:43,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:43,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:43,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:34:43,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err51ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:43,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1387704877, now seen corresponding path program 1 times [2025-01-09 21:34:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333426912] [2025-01-09 21:34:43,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:43,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:34:43,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:34:43,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:43,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:43,371 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:34:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333426912] [2025-01-09 21:34:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333426912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952547929] [2025-01-09 21:34:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:43,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:43,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:43,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:43,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:43,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1242 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:34:43,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:43,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:43,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:43,909 INFO L124 PetriNetUnfolderBase]: 245/2996 cut-off events. [2025-01-09 21:34:43,909 INFO L125 PetriNetUnfolderBase]: For 277/278 co-relation queries the response was YES. [2025-01-09 21:34:43,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 2996 events. 245/2996 cut-off events. For 277/278 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 20094 event pairs, 116 based on Foata normal form. 0/2757 useless extension candidates. Maximal degree in co-relation 3745. Up to 417 conditions per place. [2025-01-09 21:34:43,926 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-01-09 21:34:43,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 533 transitions, 1329 flow [2025-01-09 21:34:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:43,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:43,930 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1242 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:43,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 533 transitions, 1329 flow [2025-01-09 21:34:43,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 533 transitions, 1325 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:43,939 INFO L231 Difference]: Finished difference. Result has 525 places, 532 transitions, 1240 flow [2025-01-09 21:34:43,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=525, PETRI_TRANSITIONS=532} [2025-01-09 21:34:43,940 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -58 predicate places. [2025-01-09 21:34:43,940 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 532 transitions, 1240 flow [2025-01-09 21:34:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:34:43,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:43,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:43,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:34:43,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err43ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1049193616, now seen corresponding path program 1 times [2025-01-09 21:34:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566799004] [2025-01-09 21:34:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:43,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:34:43,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:34:43,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:43,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:43,985 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:34:43,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:43,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566799004] [2025-01-09 21:34:43,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566799004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:43,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:43,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28291331] [2025-01-09 21:34:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:43,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:43,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:43,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:43,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:44,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:44,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 532 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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:34:44,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:44,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:44,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:44,451 INFO L124 PetriNetUnfolderBase]: 244/2942 cut-off events. [2025-01-09 21:34:44,452 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-01-09 21:34:44,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3741 conditions, 2942 events. 244/2942 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19533 event pairs, 116 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 3689. Up to 418 conditions per place. [2025-01-09 21:34:44,475 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-01-09 21:34:44,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 532 transitions, 1327 flow [2025-01-09 21:34:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:44,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:44,478 INFO L175 Difference]: Start difference. First operand has 525 places, 532 transitions, 1240 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:44,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 532 transitions, 1327 flow [2025-01-09 21:34:44,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 532 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:44,489 INFO L231 Difference]: Finished difference. Result has 524 places, 531 transitions, 1238 flow [2025-01-09 21:34:44,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=524, PETRI_TRANSITIONS=531} [2025-01-09 21:34:44,490 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -59 predicate places. [2025-01-09 21:34:44,490 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 531 transitions, 1238 flow [2025-01-09 21:34:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.6666666666666) internal successors, (1703), 3 states have internal predecessors, (1703), 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:34:44,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:44,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:34:44,491 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err59ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1621925570, now seen corresponding path program 1 times [2025-01-09 21:34:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301405496] [2025-01-09 21:34:44,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:44,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:44,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:34:44,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:34:44,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:44,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:44,543 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:34:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301405496] [2025-01-09 21:34:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301405496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810362549] [2025-01-09 21:34:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:44,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:44,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:44,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:44,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 531 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:34:44,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:44,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:44,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:45,034 INFO L124 PetriNetUnfolderBase]: 240/2875 cut-off events. [2025-01-09 21:34:45,035 INFO L125 PetriNetUnfolderBase]: For 278/279 co-relation queries the response was YES. [2025-01-09 21:34:45,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 2875 events. 240/2875 cut-off events. For 278/279 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 18887 event pairs, 116 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 3615. Up to 416 conditions per place. [2025-01-09 21:34:45,054 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-01-09 21:34:45,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 531 transitions, 1325 flow [2025-01-09 21:34:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:45,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:45,057 INFO L175 Difference]: Start difference. First operand has 524 places, 531 transitions, 1238 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:45,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 531 transitions, 1325 flow [2025-01-09 21:34:45,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 531 transitions, 1321 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:45,066 INFO L231 Difference]: Finished difference. Result has 523 places, 530 transitions, 1236 flow [2025-01-09 21:34:45,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=523, PETRI_TRANSITIONS=530} [2025-01-09 21:34:45,068 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -60 predicate places. [2025-01-09 21:34:45,068 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 530 transitions, 1236 flow [2025-01-09 21:34:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:34:45,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:45,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:45,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:34:45,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err67ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:45,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 214715997, now seen corresponding path program 1 times [2025-01-09 21:34:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080690565] [2025-01-09 21:34:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:45,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:34:45,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:34:45,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:45,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:45,107 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:34:45,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:45,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080690565] [2025-01-09 21:34:45,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080690565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:45,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:45,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023272389] [2025-01-09 21:34:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:45,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:45,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:45,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:45,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:45,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 530 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:34:45,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:45,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:45,586 INFO L124 PetriNetUnfolderBase]: 239/2866 cut-off events. [2025-01-09 21:34:45,586 INFO L125 PetriNetUnfolderBase]: For 277/278 co-relation queries the response was YES. [2025-01-09 21:34:45,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 2866 events. 239/2866 cut-off events. For 277/278 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 18743 event pairs, 116 based on Foata normal form. 0/2641 useless extension candidates. Maximal degree in co-relation 3604. Up to 415 conditions per place. [2025-01-09 21:34:45,605 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 40 selfloop transitions, 2 changer transitions 1/530 dead transitions. [2025-01-09 21:34:45,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1323 flow [2025-01-09 21:34:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:45,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:45,608 INFO L175 Difference]: Start difference. First operand has 523 places, 530 transitions, 1236 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:45,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1323 flow [2025-01-09 21:34:45,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 530 transitions, 1319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:45,617 INFO L231 Difference]: Finished difference. Result has 522 places, 529 transitions, 1234 flow [2025-01-09 21:34:45,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=522, PETRI_TRANSITIONS=529} [2025-01-09 21:34:45,618 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -61 predicate places. [2025-01-09 21:34:45,618 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 529 transitions, 1234 flow [2025-01-09 21:34:45,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 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:34:45,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:45,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:34:45,619 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash -647835909, now seen corresponding path program 1 times [2025-01-09 21:34:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408237709] [2025-01-09 21:34:45,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:45,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:34:45,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:34:45,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:45,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:45,664 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:34:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408237709] [2025-01-09 21:34:45,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408237709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:45,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:45,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:45,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142314252] [2025-01-09 21:34:45,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:45,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:45,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:45,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:45,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 529 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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:34:45,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:45,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:45,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:46,253 INFO L124 PetriNetUnfolderBase]: 248/3035 cut-off events. [2025-01-09 21:34:46,253 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-01-09 21:34:46,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 3035 events. 248/3035 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 20164 event pairs, 116 based on Foata normal form. 0/2809 useless extension candidates. Maximal degree in co-relation 3793. Up to 420 conditions per place. [2025-01-09 21:34:46,278 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-01-09 21:34:46,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 529 transitions, 1321 flow [2025-01-09 21:34:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:46,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:46,283 INFO L175 Difference]: Start difference. First operand has 522 places, 529 transitions, 1234 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:46,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 529 transitions, 1321 flow [2025-01-09 21:34:46,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 529 transitions, 1317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:46,295 INFO L231 Difference]: Finished difference. Result has 521 places, 528 transitions, 1232 flow [2025-01-09 21:34:46,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=521, PETRI_TRANSITIONS=528} [2025-01-09 21:34:46,297 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -62 predicate places. [2025-01-09 21:34:46,297 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 528 transitions, 1232 flow [2025-01-09 21:34:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.6666666666666) internal successors, (1706), 3 states have internal predecessors, (1706), 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:34:46,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:46,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:46,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:34:46,298 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1408114798, now seen corresponding path program 1 times [2025-01-09 21:34:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974369199] [2025-01-09 21:34:46,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:46,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:34:46,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:34:46,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:46,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:46,379 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:34:46,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:46,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974369199] [2025-01-09 21:34:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974369199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:46,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:46,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117451403] [2025-01-09 21:34:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:46,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:46,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:46,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:46,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:46,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 528 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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:34:46,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:46,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:46,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:46,855 INFO L124 PetriNetUnfolderBase]: 247/2996 cut-off events. [2025-01-09 21:34:46,855 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-01-09 21:34:46,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2996 events. 247/2996 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19782 event pairs, 116 based on Foata normal form. 0/2776 useless extension candidates. Maximal degree in co-relation 3755. Up to 420 conditions per place. [2025-01-09 21:34:46,872 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-01-09 21:34:46,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 528 transitions, 1319 flow [2025-01-09 21:34:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:46,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:46,875 INFO L175 Difference]: Start difference. First operand has 521 places, 528 transitions, 1232 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:46,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 528 transitions, 1319 flow [2025-01-09 21:34:46,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 528 transitions, 1315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:46,884 INFO L231 Difference]: Finished difference. Result has 520 places, 527 transitions, 1230 flow [2025-01-09 21:34:46,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=520, PETRI_TRANSITIONS=527} [2025-01-09 21:34:46,885 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -63 predicate places. [2025-01-09 21:34:46,885 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 527 transitions, 1230 flow [2025-01-09 21:34:46,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 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:34:46,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:46,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:34:46,885 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:46,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:46,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1672493641, now seen corresponding path program 1 times [2025-01-09 21:34:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:46,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298396366] [2025-01-09 21:34:46,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:46,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 21:34:46,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 21:34:46,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:46,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:46,948 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:34:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298396366] [2025-01-09 21:34:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298396366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202552210] [2025-01-09 21:34:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:46,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:46,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:46,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:47,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:47,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 527 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 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:34:47,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:47,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:47,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:47,491 INFO L124 PetriNetUnfolderBase]: 246/2957 cut-off events. [2025-01-09 21:34:47,491 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-01-09 21:34:47,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 2957 events. 246/2957 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19411 event pairs, 116 based on Foata normal form. 0/2743 useless extension candidates. Maximal degree in co-relation 3716. Up to 420 conditions per place. [2025-01-09 21:34:47,504 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 41 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-01-09 21:34:47,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1317 flow [2025-01-09 21:34:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:47,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:47,508 INFO L175 Difference]: Start difference. First operand has 520 places, 527 transitions, 1230 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:47,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1317 flow [2025-01-09 21:34:47,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1313 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:47,516 INFO L231 Difference]: Finished difference. Result has 519 places, 526 transitions, 1228 flow [2025-01-09 21:34:47,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=519, PETRI_TRANSITIONS=526} [2025-01-09 21:34:47,517 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -64 predicate places. [2025-01-09 21:34:47,518 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 526 transitions, 1228 flow [2025-01-09 21:34:47,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 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:34:47,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:47,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:47,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:34:47,519 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2025-01-09 21:34:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash -621189344, now seen corresponding path program 1 times [2025-01-09 21:34:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741688597] [2025-01-09 21:34:47,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 21:34:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 21:34:47,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:47,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:47,586 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:34:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741688597] [2025-01-09 21:34:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741688597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471945405] [2025-01-09 21:34:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:47,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:47,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:47,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 627 [2025-01-09 21:34:47,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 526 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 571.6666666666666) internal successors, (1715), 3 states have internal predecessors, (1715), 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:34:47,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:47,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 627 [2025-01-09 21:34:47,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:48,067 INFO L124 PetriNetUnfolderBase]: 245/2918 cut-off events. [2025-01-09 21:34:48,068 INFO L125 PetriNetUnfolderBase]: For 279/280 co-relation queries the response was YES. [2025-01-09 21:34:48,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 2918 events. 245/2918 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 19079 event pairs, 116 based on Foata normal form. 0/2710 useless extension candidates. Maximal degree in co-relation 3677. Up to 420 conditions per place. [2025-01-09 21:34:48,089 INFO L140 encePairwiseOnDemand]: 624/627 looper letters, 0 selfloop transitions, 0 changer transitions 526/526 dead transitions. [2025-01-09 21:34:48,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 526 transitions, 1315 flow [2025-01-09 21:34:48,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:34:48,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924508240297714 [2025-01-09 21:34:48,092 INFO L175 Difference]: Start difference. First operand has 519 places, 526 transitions, 1228 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:34:48,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 526 transitions, 1315 flow [2025-01-09 21:34:48,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 526 transitions, 1311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:48,100 INFO L231 Difference]: Finished difference. Result has 518 places, 0 transitions, 0 flow [2025-01-09 21:34:48,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=627, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=518, PETRI_TRANSITIONS=0} [2025-01-09 21:34:48,102 INFO L279 CegarLoopForPetriNet]: 583 programPoint places, -65 predicate places. [2025-01-09 21:34:48,102 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 0 transitions, 0 flow [2025-01-09 21:34:48,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 571.6666666666666) internal successors, (1715), 3 states have internal predecessors, (1715), 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:34:48,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (161 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (160 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (159 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (158 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (157 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (156 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (155 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (154 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (153 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (152 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (151 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (150 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (149 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (148 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (147 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (146 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (145 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (144 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (143 of 162 remaining) [2025-01-09 21:34:48,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err53ASSERT_VIOLATIONDATA_RACE (142 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err60ASSERT_VIOLATIONDATA_RACE (141 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (140 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (139 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err61ASSERT_VIOLATIONDATA_RACE (138 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err54ASSERT_VIOLATIONDATA_RACE (137 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (136 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (135 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err55ASSERT_VIOLATIONDATA_RACE (134 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (133 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (132 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err62ASSERT_VIOLATIONDATA_RACE (131 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (130 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err63ASSERT_VIOLATIONDATA_RACE (129 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (128 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err56ASSERT_VIOLATIONDATA_RACE (127 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (126 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (125 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err57ASSERT_VIOLATIONDATA_RACE (124 of 162 remaining) [2025-01-09 21:34:48,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err64ASSERT_VIOLATIONDATA_RACE (123 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (122 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err65ASSERT_VIOLATIONDATA_RACE (121 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (120 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (119 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err58ASSERT_VIOLATIONDATA_RACE (118 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (117 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err66ASSERT_VIOLATIONDATA_RACE (116 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err59ASSERT_VIOLATIONDATA_RACE (115 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (114 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err67ASSERT_VIOLATIONDATA_RACE (113 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (112 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (111 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (110 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (108 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (107 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (106 of 162 remaining) [2025-01-09 21:34:48,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (105 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (104 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (103 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (102 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (101 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (100 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (99 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (98 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (97 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (96 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (95 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (94 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (93 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (92 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (91 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (90 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (89 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (88 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (87 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (86 of 162 remaining) [2025-01-09 21:34:48,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (85 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (84 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (83 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (82 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (81 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (80 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (79 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (78 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (77 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (76 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (69 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (66 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (65 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (64 of 162 remaining) [2025-01-09 21:34:48,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (63 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (62 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (61 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (59 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (57 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err53ASSERT_VIOLATIONDATA_RACE (56 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err60ASSERT_VIOLATIONDATA_RACE (55 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (54 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (53 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err61ASSERT_VIOLATIONDATA_RACE (52 of 162 remaining) [2025-01-09 21:34:48,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err54ASSERT_VIOLATIONDATA_RACE (51 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (49 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err55ASSERT_VIOLATIONDATA_RACE (48 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (46 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err62ASSERT_VIOLATIONDATA_RACE (45 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (44 of 162 remaining) [2025-01-09 21:34:48,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err63ASSERT_VIOLATIONDATA_RACE (43 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (42 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err56ASSERT_VIOLATIONDATA_RACE (41 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (39 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err57ASSERT_VIOLATIONDATA_RACE (38 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err64ASSERT_VIOLATIONDATA_RACE (37 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (36 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err65ASSERT_VIOLATIONDATA_RACE (35 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (33 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err58ASSERT_VIOLATIONDATA_RACE (32 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (31 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err66ASSERT_VIOLATIONDATA_RACE (30 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err59ASSERT_VIOLATIONDATA_RACE (29 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (28 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err67ASSERT_VIOLATIONDATA_RACE (27 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 162 remaining) [2025-01-09 21:34:48,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (9 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (8 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (4 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (3 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 162 remaining) [2025-01-09 21:34:48,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 162 remaining) [2025-01-09 21:34:48,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 162 remaining) [2025-01-09 21:34:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:34:48,116 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:34:48,122 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:48,122 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:48,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:48 BasicIcfg [2025-01-09 21:34:48,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:48,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:48,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:48,131 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:48,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:32" (3/4) ... [2025-01-09 21:34:48,133 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:48,136 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:48,136 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:48,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 21:34:48,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:48,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:48,141 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:48,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:48,220 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:48,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:48,221 INFO L158 Benchmark]: Toolchain (without parser) took 17458.03ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 121.8MB in the beginning and 485.1MB in the end (delta: -363.3MB). Peak memory consumption was 286.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:48,221 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:48,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.60ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 108.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:34:48,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.34ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 104.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:48,224 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 101.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:48,224 INFO L158 Benchmark]: RCFGBuilder took 901.04ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 59.8MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:34:48,225 INFO L158 Benchmark]: TraceAbstraction took 16051.83ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 59.1MB in the beginning and 489.3MB in the end (delta: -430.1MB). Peak memory consumption was 227.7MB. Max. memory is 16.1GB. [2025-01-09 21:34:48,225 INFO L158 Benchmark]: Witness Printer took 88.94ms. Allocated memory is still 822.1MB. Free memory was 489.3MB in the beginning and 485.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:48,227 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.57ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.60ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 108.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.34ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 104.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 101.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 901.04ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 59.8MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16051.83ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 59.1MB in the beginning and 489.3MB in the end (delta: -430.1MB). Peak memory consumption was 227.7MB. Max. memory is 16.1GB. * Witness Printer took 88.94ms. Allocated memory is still 822.1MB. Free memory was 489.3MB in the beginning and 485.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 60]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 67]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1061 locations, 162 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: 15.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4399 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1602 mSDsluCounter, 835 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 492 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4399 IncrementalHoareTripleChecker+Invalid, 4891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 492 mSolverCounterUnsat, 719 mSDtfsCounter, 4399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1340occurred in iteration=15, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2586 NumberOfCodeBlocks, 2586 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2562 ConstructedInterpolants, 0 QuantifiedInterpolants, 3425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 84 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:48,245 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