./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-4.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-4.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 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:34:22,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:34:22,340 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:22,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:34:22,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:34:22,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:34:22,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:34:22,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:34:22,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:34:22,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:34:22,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:34:22,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:34:22,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:34:22,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:22,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:22,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:22,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:34:22,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:34:22,376 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 -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2025-01-09 21:34:22,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:34:22,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:34:22,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:34:22,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:34:22,642 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:34:22,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-01-09 21:34:23,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b968c05b/6679021ba617481fadd53cb819956d90/FLAG9eaf7d510 [2025-01-09 21:34:23,964 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:34:23,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-01-09 21:34:23,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b968c05b/6679021ba617481fadd53cb819956d90/FLAG9eaf7d510 [2025-01-09 21:34:24,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b968c05b/6679021ba617481fadd53cb819956d90 [2025-01-09 21:34:24,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:34:24,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:34:24,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:24,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:34:24,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:34:24,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:24" (1/1) ... [2025-01-09 21:34:24,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42b39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:24, skipping insertion in model container [2025-01-09 21:34:24,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:24" (1/1) ... [2025-01-09 21:34:24,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:34:24,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:24,505 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:34:24,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:24,554 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:34:24,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:24 WrapperNode [2025-01-09 21:34:24,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:24,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:24,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:34:24,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:34:24,561 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:24" (1/1) ... [2025-01-09 21:34:24,569 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:24" (1/1) ... [2025-01-09 21:34:24,599 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 394 [2025-01-09 21:34:24,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:24,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:34:24,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:34:24,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:34:24,606 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:24" (1/1) ... [2025-01-09 21:34:24,606 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:24" (1/1) ... [2025-01-09 21:34:24,610 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:24" (1/1) ... [2025-01-09 21:34:24,610 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:24" (1/1) ... [2025-01-09 21:34:24,619 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:24" (1/1) ... [2025-01-09 21:34:24,620 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:24" (1/1) ... [2025-01-09 21:34:24,627 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:24" (1/1) ... [2025-01-09 21:34:24,628 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:24" (1/1) ... [2025-01-09 21:34:24,629 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:24" (1/1) ... [2025-01-09 21:34:24,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:34:24,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:34:24,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:34:24,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:34:24,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:24" (1/1) ... [2025-01-09 21:34:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:34:24,654 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:24,656 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:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:34:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:34:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:34:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:34:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:34:24,672 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:24,761 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:34:24,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:34:25,319 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:34:25,319 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:34:25,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:34:25,346 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:34:25,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:25 BoogieIcfgContainer [2025-01-09 21:34:25,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:34:25,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:34:25,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:34:25,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:34:25,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:34:24" (1/3) ... [2025-01-09 21:34:25,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22151225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:25, skipping insertion in model container [2025-01-09 21:34:25,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:24" (2/3) ... [2025-01-09 21:34:25,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22151225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:25, skipping insertion in model container [2025-01-09 21:34:25,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:25" (3/3) ... [2025-01-09 21:34:25,355 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2025-01-09 21:34:25,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:34:25,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-4.wvr.c that has 3 procedures, 505 locations, 1 initial locations, 3 loop locations, and 69 error locations. [2025-01-09 21:34:25,365 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:34:25,472 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:34:25,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 532 transitions, 1078 flow [2025-01-09 21:34:25,623 INFO L124 PetriNetUnfolderBase]: 28/530 cut-off events. [2025-01-09 21:34:25,626 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:25,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 530 events. 28/530 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1432 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 405. Up to 2 conditions per place. [2025-01-09 21:34:25,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 532 transitions, 1078 flow [2025-01-09 21:34:25,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 493 places, 513 transitions, 1038 flow [2025-01-09 21:34:25,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:34:25,666 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;@719dc491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:34:25,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 132 error locations. [2025-01-09 21:34:25,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:34:25,671 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:34:25,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:34:25,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:25,672 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:25,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:25,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1620355681, now seen corresponding path program 1 times [2025-01-09 21:34:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281943468] [2025-01-09 21:34:25,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:25,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:34:25,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:34:25,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:25,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:25,771 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:25,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281943468] [2025-01-09 21:34:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281943468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:25,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588420] [2025-01-09 21:34:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:25,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:25,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:25,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:25,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:25,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 532 [2025-01-09 21:34:25,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 513 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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:25,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:25,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 532 [2025-01-09 21:34:25,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:26,032 INFO L124 PetriNetUnfolderBase]: 33/772 cut-off events. [2025-01-09 21:34:26,032 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:34:26,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 772 events. 33/772 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3509 event pairs, 9 based on Foata normal form. 16/640 useless extension candidates. Maximal degree in co-relation 683. Up to 36 conditions per place. [2025-01-09 21:34:26,052 INFO L140 encePairwiseOnDemand]: 516/532 looper letters, 12 selfloop transitions, 2 changer transitions 3/499 dead transitions. [2025-01-09 21:34:26,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 499 transitions, 1038 flow [2025-01-09 21:34:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1531 transitions. [2025-01-09 21:34:26,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9592731829573935 [2025-01-09 21:34:26,079 INFO L175 Difference]: Start difference. First operand has 493 places, 513 transitions, 1038 flow. Second operand 3 states and 1531 transitions. [2025-01-09 21:34:26,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 499 transitions, 1038 flow [2025-01-09 21:34:26,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 499 transitions, 1030 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:34:26,092 INFO L231 Difference]: Finished difference. Result has 490 places, 496 transitions, 1000 flow [2025-01-09 21:34:26,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1000, PETRI_PLACES=490, PETRI_TRANSITIONS=496} [2025-01-09 21:34:26,097 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -3 predicate places. [2025-01-09 21:34:26,097 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 496 transitions, 1000 flow [2025-01-09 21:34:26,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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:26,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:26,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:26,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:34:26,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:26,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1299018090, now seen corresponding path program 1 times [2025-01-09 21:34:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147202074] [2025-01-09 21:34:26,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:26,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:34:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:34:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:26,139 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:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:26,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147202074] [2025-01-09 21:34:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147202074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:26,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551807927] [2025-01-09 21:34:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:26,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:26,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:26,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 496 out of 532 [2025-01-09 21:34:26,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 496 transitions, 1000 flow. Second operand has 3 states, 3 states have (on average 497.3333333333333) internal successors, (1492), 3 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:26,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:26,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 496 of 532 [2025-01-09 21:34:26,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:26,323 INFO L124 PetriNetUnfolderBase]: 40/852 cut-off events. [2025-01-09 21:34:26,324 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-01-09 21:34:26,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 852 events. 40/852 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3735 event pairs, 15 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 881. Up to 48 conditions per place. [2025-01-09 21:34:26,330 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 17 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-01-09 21:34:26,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 495 transitions, 1036 flow [2025-01-09 21:34:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2025-01-09 21:34:26,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448621553884712 [2025-01-09 21:34:26,334 INFO L175 Difference]: Start difference. First operand has 490 places, 496 transitions, 1000 flow. Second operand 3 states and 1508 transitions. [2025-01-09 21:34:26,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 495 transitions, 1036 flow [2025-01-09 21:34:26,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 495 transitions, 1032 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:26,341 INFO L231 Difference]: Finished difference. Result has 486 places, 495 transitions, 998 flow [2025-01-09 21:34:26,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=998, PETRI_PLACES=486, PETRI_TRANSITIONS=495} [2025-01-09 21:34:26,342 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -7 predicate places. [2025-01-09 21:34:26,342 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 495 transitions, 998 flow [2025-01-09 21:34:26,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 497.3333333333333) internal successors, (1492), 3 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:26,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:26,343 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:26,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:26,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -187551629, now seen corresponding path program 1 times [2025-01-09 21:34:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171767313] [2025-01-09 21:34:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:26,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:34:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:34:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:26,389 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:26,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171767313] [2025-01-09 21:34:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171767313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:26,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:26,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:26,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285055462] [2025-01-09 21:34:26,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:26,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:26,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:26,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 532 [2025-01-09 21:34:26,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 495 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 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:26,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:26,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 532 [2025-01-09 21:34:26,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:26,632 INFO L124 PetriNetUnfolderBase]: 142/1933 cut-off events. [2025-01-09 21:34:26,633 INFO L125 PetriNetUnfolderBase]: For 33/34 co-relation queries the response was YES. [2025-01-09 21:34:26,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1933 events. 142/1933 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 12032 event pairs, 44 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 2064. Up to 157 conditions per place. [2025-01-09 21:34:26,672 INFO L140 encePairwiseOnDemand]: 521/532 looper letters, 24 selfloop transitions, 1 changer transitions 0/485 dead transitions. [2025-01-09 21:34:26,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 485 transitions, 1028 flow [2025-01-09 21:34:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2025-01-09 21:34:26,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279448621553885 [2025-01-09 21:34:26,675 INFO L175 Difference]: Start difference. First operand has 486 places, 495 transitions, 998 flow. Second operand 3 states and 1481 transitions. [2025-01-09 21:34:26,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 485 transitions, 1028 flow [2025-01-09 21:34:26,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 485 transitions, 1024 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:26,681 INFO L231 Difference]: Finished difference. Result has 476 places, 485 transitions, 976 flow [2025-01-09 21:34:26,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=476, PETRI_TRANSITIONS=485} [2025-01-09 21:34:26,683 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -17 predicate places. [2025-01-09 21:34:26,683 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 485 transitions, 976 flow [2025-01-09 21:34:26,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 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:26,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:26,684 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:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:26,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1816580338, now seen corresponding path program 1 times [2025-01-09 21:34:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362950112] [2025-01-09 21:34:26,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:26,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:34:26,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:34:26,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:26,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,259 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:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362950112] [2025-01-09 21:34:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362950112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698402140] [2025-01-09 21:34:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:27,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:27,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:27,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 467 out of 532 [2025-01-09 21:34:27,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 485 transitions, 976 flow. Second operand has 6 states, 6 states have (on average 468.5) internal successors, (2811), 6 states have internal predecessors, (2811), 0 states have call successors, (0), 0 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:27,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:27,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 467 of 532 [2025-01-09 21:34:27,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:27,743 INFO L124 PetriNetUnfolderBase]: 289/2556 cut-off events. [2025-01-09 21:34:27,743 INFO L125 PetriNetUnfolderBase]: For 60/61 co-relation queries the response was YES. [2025-01-09 21:34:27,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 2556 events. 289/2556 cut-off events. For 60/61 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17194 event pairs, 144 based on Foata normal form. 0/2068 useless extension candidates. Maximal degree in co-relation 2943. Up to 408 conditions per place. [2025-01-09 21:34:27,760 INFO L140 encePairwiseOnDemand]: 526/532 looper letters, 44 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-01-09 21:34:27,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 484 transitions, 1072 flow [2025-01-09 21:34:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2852 transitions. [2025-01-09 21:34:27,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.893483709273183 [2025-01-09 21:34:27,765 INFO L175 Difference]: Start difference. First operand has 476 places, 485 transitions, 976 flow. Second operand 6 states and 2852 transitions. [2025-01-09 21:34:27,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 484 transitions, 1072 flow [2025-01-09 21:34:27,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 484 transitions, 1071 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:27,771 INFO L231 Difference]: Finished difference. Result has 479 places, 484 transitions, 983 flow [2025-01-09 21:34:27,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=983, PETRI_PLACES=479, PETRI_TRANSITIONS=484} [2025-01-09 21:34:27,773 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -14 predicate places. [2025-01-09 21:34:27,773 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 484 transitions, 983 flow [2025-01-09 21:34:27,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 468.5) internal successors, (2811), 6 states have internal predecessors, (2811), 0 states have call successors, (0), 0 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:27,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:27,774 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:27,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:27,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:27,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash -945614419, now seen corresponding path program 1 times [2025-01-09 21:34:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160413256] [2025-01-09 21:34:27,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:27,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:34:27,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:34:27,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,813 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:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160413256] [2025-01-09 21:34:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160413256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556010014] [2025-01-09 21:34:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:27,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:27,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 532 [2025-01-09 21:34:27,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 484 transitions, 983 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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:27,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:27,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 532 [2025-01-09 21:34:27,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:27,923 INFO L124 PetriNetUnfolderBase]: 40/833 cut-off events. [2025-01-09 21:34:27,923 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-01-09 21:34:27,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 833 events. 40/833 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3583 event pairs, 15 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 874. Up to 46 conditions per place. [2025-01-09 21:34:27,933 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 15 selfloop transitions, 2 changer transitions 0/483 dead transitions. [2025-01-09 21:34:27,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 483 transitions, 1015 flow [2025-01-09 21:34:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1512 transitions. [2025-01-09 21:34:27,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-01-09 21:34:27,939 INFO L175 Difference]: Start difference. First operand has 479 places, 484 transitions, 983 flow. Second operand 3 states and 1512 transitions. [2025-01-09 21:34:27,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 483 transitions, 1015 flow [2025-01-09 21:34:27,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 483 transitions, 1005 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:27,947 INFO L231 Difference]: Finished difference. Result has 475 places, 483 transitions, 975 flow [2025-01-09 21:34:27,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=475, PETRI_TRANSITIONS=483} [2025-01-09 21:34:27,949 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -18 predicate places. [2025-01-09 21:34:27,949 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 483 transitions, 975 flow [2025-01-09 21:34:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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:27,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:27,950 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:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:27,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 645587658, now seen corresponding path program 1 times [2025-01-09 21:34:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019028163] [2025-01-09 21:34:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:34:27,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:34:27,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:27,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,980 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:27,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019028163] [2025-01-09 21:34:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019028163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949419597] [2025-01-09 21:34:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:27,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:28,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 532 [2025-01-09 21:34:28,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 483 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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:28,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:28,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 532 [2025-01-09 21:34:28,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,112 INFO L124 PetriNetUnfolderBase]: 84/1574 cut-off events. [2025-01-09 21:34:28,112 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:28,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 1574 events. 84/1574 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9534 event pairs, 17 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1628. Up to 77 conditions per place. [2025-01-09 21:34:28,120 INFO L140 encePairwiseOnDemand]: 525/532 looper letters, 16 selfloop transitions, 2 changer transitions 0/481 dead transitions. [2025-01-09 21:34:28,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 481 transitions, 1008 flow [2025-01-09 21:34:28,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1514 transitions. [2025-01-09 21:34:28,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486215538847118 [2025-01-09 21:34:28,123 INFO L175 Difference]: Start difference. First operand has 475 places, 483 transitions, 975 flow. Second operand 3 states and 1514 transitions. [2025-01-09 21:34:28,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 481 transitions, 1008 flow [2025-01-09 21:34:28,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 481 transitions, 1004 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:28,130 INFO L231 Difference]: Finished difference. Result has 471 places, 480 transitions, 975 flow [2025-01-09 21:34:28,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=471, PETRI_TRANSITIONS=480} [2025-01-09 21:34:28,131 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -22 predicate places. [2025-01-09 21:34:28,131 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 480 transitions, 975 flow [2025-01-09 21:34:28,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 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:28,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:28,132 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:28,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:28,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -160424456, now seen corresponding path program 1 times [2025-01-09 21:34:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89429424] [2025-01-09 21:34:28,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:28,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:34:28,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:34:28,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:28,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:28,160 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:28,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89429424] [2025-01-09 21:34:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89429424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650345794] [2025-01-09 21:34:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:28,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:28,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:28,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 532 [2025-01-09 21:34:28,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 480 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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:28,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:28,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 532 [2025-01-09 21:34:28,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,262 INFO L124 PetriNetUnfolderBase]: 46/1161 cut-off events. [2025-01-09 21:34:28,262 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2025-01-09 21:34:28,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1161 events. 46/1161 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5469 event pairs, 1 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 1177. Up to 20 conditions per place. [2025-01-09 21:34:28,268 INFO L140 encePairwiseOnDemand]: 525/532 looper letters, 11 selfloop transitions, 3 changer transitions 0/477 dead transitions. [2025-01-09 21:34:28,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 477 transitions, 998 flow [2025-01-09 21:34:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2025-01-09 21:34:28,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2025-01-09 21:34:28,271 INFO L175 Difference]: Start difference. First operand has 471 places, 480 transitions, 975 flow. Second operand 3 states and 1518 transitions. [2025-01-09 21:34:28,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 477 transitions, 998 flow [2025-01-09 21:34:28,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 477 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:28,276 INFO L231 Difference]: Finished difference. Result has 469 places, 476 transitions, 973 flow [2025-01-09 21:34:28,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=973, PETRI_PLACES=469, PETRI_TRANSITIONS=476} [2025-01-09 21:34:28,277 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -24 predicate places. [2025-01-09 21:34:28,278 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 476 transitions, 973 flow [2025-01-09 21:34:28,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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:28,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:28,278 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:28,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:28,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash -319898888, now seen corresponding path program 1 times [2025-01-09 21:34:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7172551] [2025-01-09 21:34:28,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:28,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:34:28,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:34:28,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:28,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:28,309 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:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7172551] [2025-01-09 21:34:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7172551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012583190] [2025-01-09 21:34:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:28,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:28,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:28,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:28,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 532 [2025-01-09 21:34:28,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 476 transitions, 973 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:28,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:28,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 532 [2025-01-09 21:34:28,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,508 INFO L124 PetriNetUnfolderBase]: 83/1035 cut-off events. [2025-01-09 21:34:28,510 INFO L125 PetriNetUnfolderBase]: For 51/52 co-relation queries the response was YES. [2025-01-09 21:34:28,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 1035 events. 83/1035 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5398 event pairs, 7 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 1220. Up to 169 conditions per place. [2025-01-09 21:34:28,514 INFO L140 encePairwiseOnDemand]: 495/532 looper letters, 39 selfloop transitions, 14 changer transitions 4/455 dead transitions. [2025-01-09 21:34:28,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 455 transitions, 1042 flow [2025-01-09 21:34:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-01-09 21:34:28,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87531328320802 [2025-01-09 21:34:28,517 INFO L175 Difference]: Start difference. First operand has 469 places, 476 transitions, 973 flow. Second operand 3 states and 1397 transitions. [2025-01-09 21:34:28,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 455 transitions, 1042 flow [2025-01-09 21:34:28,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 455 transitions, 1036 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:28,523 INFO L231 Difference]: Finished difference. Result has 447 places, 450 transitions, 942 flow [2025-01-09 21:34:28,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=942, PETRI_PLACES=447, PETRI_TRANSITIONS=450} [2025-01-09 21:34:28,525 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -46 predicate places. [2025-01-09 21:34:28,525 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 450 transitions, 942 flow [2025-01-09 21:34:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:28,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:28,526 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:28,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:28,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -622044489, now seen corresponding path program 1 times [2025-01-09 21:34:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628591949] [2025-01-09 21:34:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:28,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:34:28,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:34:28,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:28,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:28,572 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:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628591949] [2025-01-09 21:34:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628591949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:28,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:28,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079136311] [2025-01-09 21:34:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:28,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:28,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:28,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:28,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 488 out of 532 [2025-01-09 21:34:28,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 450 transitions, 942 flow. Second operand has 3 states, 3 states have (on average 489.3333333333333) internal successors, (1468), 3 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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:28,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:28,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 488 of 532 [2025-01-09 21:34:28,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,891 INFO L124 PetriNetUnfolderBase]: 139/2007 cut-off events. [2025-01-09 21:34:28,892 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:28,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 2007 events. 139/2007 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 12669 event pairs, 15 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2226. Up to 143 conditions per place. [2025-01-09 21:34:28,910 INFO L140 encePairwiseOnDemand]: 519/532 looper letters, 22 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-01-09 21:34:28,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 449 transitions, 996 flow [2025-01-09 21:34:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1499 transitions. [2025-01-09 21:34:28,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9392230576441103 [2025-01-09 21:34:28,913 INFO L175 Difference]: Start difference. First operand has 447 places, 450 transitions, 942 flow. Second operand 3 states and 1499 transitions. [2025-01-09 21:34:28,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 449 transitions, 996 flow [2025-01-09 21:34:28,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 449 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:28,927 INFO L231 Difference]: Finished difference. Result has 436 places, 447 transitions, 933 flow [2025-01-09 21:34:28,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=436, PETRI_TRANSITIONS=447} [2025-01-09 21:34:28,928 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -57 predicate places. [2025-01-09 21:34:28,928 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 447 transitions, 933 flow [2025-01-09 21:34:28,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 489.3333333333333) internal successors, (1468), 3 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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:28,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:28,929 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:28,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:34:28,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1980091613, now seen corresponding path program 1 times [2025-01-09 21:34:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117969740] [2025-01-09 21:34:28,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:34:28,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:34:28,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:28,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:29,017 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:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117969740] [2025-01-09 21:34:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117969740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:29,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057611210] [2025-01-09 21:34:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:29,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:29,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:29,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:29,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 532 [2025-01-09 21:34:29,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 447 transitions, 933 flow. Second operand has 4 states, 4 states have (on average 507.25) internal successors, (2029), 4 states have internal predecessors, (2029), 0 states have call successors, (0), 0 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:29,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:29,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 532 [2025-01-09 21:34:29,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:29,281 INFO L124 PetriNetUnfolderBase]: 127/2483 cut-off events. [2025-01-09 21:34:29,282 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:29,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 2483 events. 127/2483 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 16411 event pairs, 7 based on Foata normal form. 0/2213 useless extension candidates. Maximal degree in co-relation 2602. Up to 59 conditions per place. [2025-01-09 21:34:29,298 INFO L140 encePairwiseOnDemand]: 526/532 looper letters, 13 selfloop transitions, 6 changer transitions 0/456 dead transitions. [2025-01-09 21:34:29,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 456 transitions, 993 flow [2025-01-09 21:34:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2550 transitions. [2025-01-09 21:34:29,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9586466165413534 [2025-01-09 21:34:29,304 INFO L175 Difference]: Start difference. First operand has 436 places, 447 transitions, 933 flow. Second operand 5 states and 2550 transitions. [2025-01-09 21:34:29,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 456 transitions, 993 flow [2025-01-09 21:34:29,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 456 transitions, 993 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:29,310 INFO L231 Difference]: Finished difference. Result has 443 places, 451 transitions, 971 flow [2025-01-09 21:34:29,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=971, PETRI_PLACES=443, PETRI_TRANSITIONS=451} [2025-01-09 21:34:29,312 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -50 predicate places. [2025-01-09 21:34:29,313 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 451 transitions, 971 flow [2025-01-09 21:34:29,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 507.25) internal successors, (2029), 4 states have internal predecessors, (2029), 0 states have call successors, (0), 0 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:29,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:29,314 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:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:34:29,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1809253885, now seen corresponding path program 1 times [2025-01-09 21:34:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:29,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-01-09 21:34:29,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:29,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:34:29,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:34:29,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:29,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:29,609 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:29,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:29,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-01-09 21:34:29,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660636648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:29,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:29,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668962933] [2025-01-09 21:34:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:29,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:29,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:29,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:29,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 532 [2025-01-09 21:34:29,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 451 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 500.5) internal successors, (3003), 6 states have internal predecessors, (3003), 0 states have call successors, (0), 0 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:29,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:29,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 532 [2025-01-09 21:34:29,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:30,114 INFO L124 PetriNetUnfolderBase]: 102/1913 cut-off events. [2025-01-09 21:34:30,114 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:34:30,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 1913 events. 102/1913 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11503 event pairs, 6 based on Foata normal form. 0/1717 useless extension candidates. Maximal degree in co-relation 2053. Up to 46 conditions per place. [2025-01-09 21:34:30,125 INFO L140 encePairwiseOnDemand]: 526/532 looper letters, 15 selfloop transitions, 6 changer transitions 0/454 dead transitions. [2025-01-09 21:34:30,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 454 transitions, 1023 flow [2025-01-09 21:34:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3015 transitions. [2025-01-09 21:34:30,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9445488721804511 [2025-01-09 21:34:30,129 INFO L175 Difference]: Start difference. First operand has 443 places, 451 transitions, 971 flow. Second operand 6 states and 3015 transitions. [2025-01-09 21:34:30,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 454 transitions, 1023 flow [2025-01-09 21:34:30,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 454 transitions, 1023 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:30,134 INFO L231 Difference]: Finished difference. Result has 447 places, 450 transitions, 981 flow [2025-01-09 21:34:30,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=447, PETRI_TRANSITIONS=450} [2025-01-09 21:34:30,135 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -46 predicate places. [2025-01-09 21:34:30,135 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 450 transitions, 981 flow [2025-01-09 21:34:30,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 500.5) internal successors, (3003), 6 states have internal predecessors, (3003), 0 states have call successors, (0), 0 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:30,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:30,136 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:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:34:30,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1577005101, now seen corresponding path program 1 times [2025-01-09 21:34:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059874580] [2025-01-09 21:34:30,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:30,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:34:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:34:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:30,200 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:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:30,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059874580] [2025-01-09 21:34:30,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059874580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:30,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:30,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079523838] [2025-01-09 21:34:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:30,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:30,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:30,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:30,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 532 [2025-01-09 21:34:30,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 450 transitions, 981 flow. Second operand has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 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:30,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:30,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 532 [2025-01-09 21:34:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:30,559 INFO L124 PetriNetUnfolderBase]: 155/2631 cut-off events. [2025-01-09 21:34:30,559 INFO L125 PetriNetUnfolderBase]: For 48/49 co-relation queries the response was YES. [2025-01-09 21:34:30,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 2631 events. 155/2631 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16738 event pairs, 14 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 2924. Up to 111 conditions per place. [2025-01-09 21:34:30,571 INFO L140 encePairwiseOnDemand]: 523/532 looper letters, 18 selfloop transitions, 9 changer transitions 0/461 dead transitions. [2025-01-09 21:34:30,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 461 transitions, 1060 flow [2025-01-09 21:34:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2528 transitions. [2025-01-09 21:34:30,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503759398496241 [2025-01-09 21:34:30,575 INFO L175 Difference]: Start difference. First operand has 447 places, 450 transitions, 981 flow. Second operand 5 states and 2528 transitions. [2025-01-09 21:34:30,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 461 transitions, 1060 flow [2025-01-09 21:34:30,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 461 transitions, 1048 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:30,582 INFO L231 Difference]: Finished difference. Result has 449 places, 457 transitions, 1031 flow [2025-01-09 21:34:30,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1031, PETRI_PLACES=449, PETRI_TRANSITIONS=457} [2025-01-09 21:34:30,584 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -44 predicate places. [2025-01-09 21:34:30,584 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 457 transitions, 1031 flow [2025-01-09 21:34:30,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 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:30,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:30,585 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:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:34:30,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash 93509062, now seen corresponding path program 1 times [2025-01-09 21:34:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:30,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122636958] [2025-01-09 21:34:30,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:30,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:34:30,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:34:30,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:30,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:30,617 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:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122636958] [2025-01-09 21:34:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122636958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:30,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:30,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589461746] [2025-01-09 21:34:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:30,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:30,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:30,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:30,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 532 [2025-01-09 21:34:30,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 457 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 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:30,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:30,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 532 [2025-01-09 21:34:30,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:30,911 INFO L124 PetriNetUnfolderBase]: 176/3706 cut-off events. [2025-01-09 21:34:30,912 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-09 21:34:30,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4114 conditions, 3706 events. 176/3706 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 27692 event pairs, 18 based on Foata normal form. 0/3331 useless extension candidates. Maximal degree in co-relation 4068. Up to 91 conditions per place. [2025-01-09 21:34:30,922 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 9 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2025-01-09 21:34:30,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 457 transitions, 1054 flow [2025-01-09 21:34:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1524 transitions. [2025-01-09 21:34:30,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548872180451128 [2025-01-09 21:34:30,925 INFO L175 Difference]: Start difference. First operand has 449 places, 457 transitions, 1031 flow. Second operand 3 states and 1524 transitions. [2025-01-09 21:34:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 457 transitions, 1054 flow [2025-01-09 21:34:30,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 457 transitions, 1054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:30,929 INFO L231 Difference]: Finished difference. Result has 450 places, 456 transitions, 1033 flow [2025-01-09 21:34:30,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=450, PETRI_TRANSITIONS=456} [2025-01-09 21:34:30,930 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -43 predicate places. [2025-01-09 21:34:30,931 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 456 transitions, 1033 flow [2025-01-09 21:34:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 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:30,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:30,931 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:30,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:34:30,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:30,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1421555617, now seen corresponding path program 1 times [2025-01-09 21:34:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804996073] [2025-01-09 21:34:30,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:30,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:34:30,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:34:30,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:30,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:31,001 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:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:31,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804996073] [2025-01-09 21:34:31,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804996073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:31,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999946899] [2025-01-09 21:34:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:31,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:31,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:31,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:31,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 532 [2025-01-09 21:34:31,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 456 transitions, 1033 flow. Second operand has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 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:31,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:31,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 532 [2025-01-09 21:34:31,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:31,345 INFO L124 PetriNetUnfolderBase]: 152/2619 cut-off events. [2025-01-09 21:34:31,345 INFO L125 PetriNetUnfolderBase]: For 148/149 co-relation queries the response was YES. [2025-01-09 21:34:31,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 2619 events. 152/2619 cut-off events. For 148/149 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 16633 event pairs, 14 based on Foata normal form. 0/2363 useless extension candidates. Maximal degree in co-relation 2997. Up to 111 conditions per place. [2025-01-09 21:34:31,360 INFO L140 encePairwiseOnDemand]: 523/532 looper letters, 18 selfloop transitions, 9 changer transitions 0/463 dead transitions. [2025-01-09 21:34:31,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 463 transitions, 1104 flow [2025-01-09 21:34:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2528 transitions. [2025-01-09 21:34:31,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503759398496241 [2025-01-09 21:34:31,364 INFO L175 Difference]: Start difference. First operand has 450 places, 456 transitions, 1033 flow. Second operand 5 states and 2528 transitions. [2025-01-09 21:34:31,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 463 transitions, 1104 flow [2025-01-09 21:34:31,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 463 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:31,370 INFO L231 Difference]: Finished difference. Result has 455 places, 459 transitions, 1075 flow [2025-01-09 21:34:31,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1075, PETRI_PLACES=455, PETRI_TRANSITIONS=459} [2025-01-09 21:34:31,371 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -38 predicate places. [2025-01-09 21:34:31,371 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 459 transitions, 1075 flow [2025-01-09 21:34:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 501.5) internal successors, (2006), 4 states have internal predecessors, (2006), 0 states have call successors, (0), 0 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:31,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:31,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:34:31,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:31,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1809683299, now seen corresponding path program 1 times [2025-01-09 21:34:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782688444] [2025-01-09 21:34:31,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:31,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:34:31,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:34:31,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:31,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:31,623 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:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782688444] [2025-01-09 21:34:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782688444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389669973] [2025-01-09 21:34:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:31,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:31,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 532 [2025-01-09 21:34:31,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 459 transitions, 1075 flow. Second operand has 6 states, 6 states have (on average 458.6666666666667) internal successors, (2752), 6 states have internal predecessors, (2752), 0 states have call successors, (0), 0 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:31,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:31,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 532 [2025-01-09 21:34:31,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:32,176 INFO L124 PetriNetUnfolderBase]: 226/2195 cut-off events. [2025-01-09 21:34:32,176 INFO L125 PetriNetUnfolderBase]: For 305/306 co-relation queries the response was YES. [2025-01-09 21:34:32,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 2195 events. 226/2195 cut-off events. For 305/306 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13366 event pairs, 24 based on Foata normal form. 0/2037 useless extension candidates. Maximal degree in co-relation 2997. Up to 176 conditions per place. [2025-01-09 21:34:32,186 INFO L140 encePairwiseOnDemand]: 490/532 looper letters, 21 selfloop transitions, 39 changer transitions 0/456 dead transitions. [2025-01-09 21:34:32,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 456 transitions, 1193 flow [2025-01-09 21:34:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2805 transitions. [2025-01-09 21:34:32,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787593984962406 [2025-01-09 21:34:32,191 INFO L175 Difference]: Start difference. First operand has 455 places, 459 transitions, 1075 flow. Second operand 6 states and 2805 transitions. [2025-01-09 21:34:32,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 456 transitions, 1193 flow [2025-01-09 21:34:32,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 456 transitions, 1193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:32,196 INFO L231 Difference]: Finished difference. Result has 453 places, 452 transitions, 1139 flow [2025-01-09 21:34:32,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1139, PETRI_PLACES=453, PETRI_TRANSITIONS=452} [2025-01-09 21:34:32,197 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -40 predicate places. [2025-01-09 21:34:32,197 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 452 transitions, 1139 flow [2025-01-09 21:34:32,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 458.6666666666667) internal successors, (2752), 6 states have internal predecessors, (2752), 0 states have call successors, (0), 0 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,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:32,198 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:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:34:32,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:32,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1424544813, now seen corresponding path program 1 times [2025-01-09 21:34:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149738631] [2025-01-09 21:34:32,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:32,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:34:32,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:34:32,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:32,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:32,234 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,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:32,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149738631] [2025-01-09 21:34:32,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149738631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:32,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:32,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722243216] [2025-01-09 21:34:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:32,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:32,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:32,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:32,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:32,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:32,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 452 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:32,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:32,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:32,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:32,604 INFO L124 PetriNetUnfolderBase]: 198/2493 cut-off events. [2025-01-09 21:34:32,604 INFO L125 PetriNetUnfolderBase]: For 315/316 co-relation queries the response was YES. [2025-01-09 21:34:32,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 2493 events. 198/2493 cut-off events. For 315/316 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15841 event pairs, 92 based on Foata normal form. 0/2302 useless extension candidates. Maximal degree in co-relation 3388. Up to 332 conditions per place. [2025-01-09 21:34:32,621 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 33 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-01-09 21:34:32,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1210 flow [2025-01-09 21:34:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:32,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:32,623 INFO L175 Difference]: Start difference. First operand has 453 places, 452 transitions, 1139 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:32,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1210 flow [2025-01-09 21:34:32,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 452 transitions, 1132 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:32,629 INFO L231 Difference]: Finished difference. Result has 449 places, 451 transitions, 1063 flow [2025-01-09 21:34:32,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=449, PETRI_TRANSITIONS=451} [2025-01-09 21:34:32,630 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -44 predicate places. [2025-01-09 21:34:32,630 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 451 transitions, 1063 flow [2025-01-09 21:34:32,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:32,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:32,630 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:32,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:34:32,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err44ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1681468167, now seen corresponding path program 1 times [2025-01-09 21:34:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226578946] [2025-01-09 21:34:32,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:32,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:34:32,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:34:32,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:32,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:32,656 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,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:32,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226578946] [2025-01-09 21:34:32,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226578946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:32,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:32,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883284447] [2025-01-09 21:34:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:32,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:32,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:32,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:32,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 451 transitions, 1063 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 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,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:32,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:32,938 INFO L124 PetriNetUnfolderBase]: 193/2380 cut-off events. [2025-01-09 21:34:32,938 INFO L125 PetriNetUnfolderBase]: For 231/232 co-relation queries the response was YES. [2025-01-09 21:34:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 2380 events. 193/2380 cut-off events. For 231/232 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14940 event pairs, 92 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 2997. Up to 329 conditions per place. [2025-01-09 21:34:32,947 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 33 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-01-09 21:34:32,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 1134 flow [2025-01-09 21:34:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:32,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:32,949 INFO L175 Difference]: Start difference. First operand has 449 places, 451 transitions, 1063 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:32,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 1134 flow [2025-01-09 21:34:32,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:32,953 INFO L231 Difference]: Finished difference. Result has 448 places, 450 transitions, 1061 flow [2025-01-09 21:34:32,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=448, PETRI_TRANSITIONS=450} [2025-01-09 21:34:32,954 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -45 predicate places. [2025-01-09 21:34:32,954 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 450 transitions, 1061 flow [2025-01-09 21:34:32,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 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,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:32,954 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:32,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:34:32,955 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:32,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1720437568, now seen corresponding path program 1 times [2025-01-09 21:34:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:32,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601982803] [2025-01-09 21:34:32,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:32,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:34:32,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:34:32,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:32,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:32,979 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,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601982803] [2025-01-09 21:34:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601982803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913771619] [2025-01-09 21:34:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:32,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:32,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:32,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:33,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:33,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 450 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:33,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:33,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:33,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:33,236 INFO L124 PetriNetUnfolderBase]: 194/2380 cut-off events. [2025-01-09 21:34:33,236 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2025-01-09 21:34:33,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3051 conditions, 2380 events. 194/2380 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15003 event pairs, 92 based on Foata normal form. 0/2200 useless extension candidates. Maximal degree in co-relation 2999. Up to 330 conditions per place. [2025-01-09 21:34:33,250 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 33 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-01-09 21:34:33,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 450 transitions, 1132 flow [2025-01-09 21:34:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:33,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:33,252 INFO L175 Difference]: Start difference. First operand has 448 places, 450 transitions, 1061 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:33,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 450 transitions, 1132 flow [2025-01-09 21:34:33,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 450 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:33,257 INFO L231 Difference]: Finished difference. Result has 447 places, 449 transitions, 1059 flow [2025-01-09 21:34:33,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=447, PETRI_TRANSITIONS=449} [2025-01-09 21:34:33,257 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -46 predicate places. [2025-01-09 21:34:33,257 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 449 transitions, 1059 flow [2025-01-09 21:34:33,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:33,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:33,258 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:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:34:33,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err52ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 202439865, now seen corresponding path program 1 times [2025-01-09 21:34:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605473512] [2025-01-09 21:34:33,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:33,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:34:33,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:34:33,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:33,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:33,291 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,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605473512] [2025-01-09 21:34:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605473512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53349036] [2025-01-09 21:34:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:33,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:33,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:33,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:33,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 449 transitions, 1059 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 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,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:33,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:33,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:33,540 INFO L124 PetriNetUnfolderBase]: 190/2313 cut-off events. [2025-01-09 21:34:33,540 INFO L125 PetriNetUnfolderBase]: For 232/233 co-relation queries the response was YES. [2025-01-09 21:34:33,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2977 conditions, 2313 events. 190/2313 cut-off events. For 232/233 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14319 event pairs, 92 based on Foata normal form. 0/2139 useless extension candidates. Maximal degree in co-relation 2925. Up to 328 conditions per place. [2025-01-09 21:34:33,554 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 32 selfloop transitions, 2 changer transitions 1/449 dead transitions. [2025-01-09 21:34:33,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 449 transitions, 1130 flow [2025-01-09 21:34:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:33,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:33,556 INFO L175 Difference]: Start difference. First operand has 447 places, 449 transitions, 1059 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:33,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 449 transitions, 1130 flow [2025-01-09 21:34:33,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 449 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:33,561 INFO L231 Difference]: Finished difference. Result has 446 places, 448 transitions, 1057 flow [2025-01-09 21:34:33,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=446, PETRI_TRANSITIONS=448} [2025-01-09 21:34:33,562 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -47 predicate places. [2025-01-09 21:34:33,562 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 448 transitions, 1057 flow [2025-01-09 21:34:33,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 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,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:33,562 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:33,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:34:33,562 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2122902062, now seen corresponding path program 1 times [2025-01-09 21:34:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705442252] [2025-01-09 21:34:33,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:33,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:34:33,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:34:33,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:33,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:33,612 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,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705442252] [2025-01-09 21:34:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705442252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:33,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:33,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:33,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630366825] [2025-01-09 21:34:33,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:33,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:33,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:33,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:33,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:33,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 448 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 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,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:33,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:33,873 INFO L124 PetriNetUnfolderBase]: 197/2443 cut-off events. [2025-01-09 21:34:33,873 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2025-01-09 21:34:33,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 2443 events. 197/2443 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 15318 event pairs, 92 based on Foata normal form. 0/2270 useless extension candidates. Maximal degree in co-relation 3073. Up to 332 conditions per place. [2025-01-09 21:34:33,893 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 33 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2025-01-09 21:34:33,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 448 transitions, 1128 flow [2025-01-09 21:34:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:33,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:33,896 INFO L175 Difference]: Start difference. First operand has 446 places, 448 transitions, 1057 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 448 transitions, 1128 flow [2025-01-09 21:34:33,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 448 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:33,901 INFO L231 Difference]: Finished difference. Result has 445 places, 447 transitions, 1055 flow [2025-01-09 21:34:33,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=445, PETRI_TRANSITIONS=447} [2025-01-09 21:34:33,901 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -48 predicate places. [2025-01-09 21:34:33,901 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 447 transitions, 1055 flow [2025-01-09 21:34:33,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 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,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:33,902 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:33,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:34:33,902 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2050034857, now seen corresponding path program 1 times [2025-01-09 21:34:33,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688394241] [2025-01-09 21:34:33,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:33,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:33,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:34:33,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:34:33,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:33,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:33,935 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,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688394241] [2025-01-09 21:34:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688394241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882993583] [2025-01-09 21:34:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:33,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:33,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:34,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:34,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 447 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 0 states have call successors, (0), 0 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,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:34,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:34,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:34,201 INFO L124 PetriNetUnfolderBase]: 196/2404 cut-off events. [2025-01-09 21:34:34,201 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2025-01-09 21:34:34,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 2404 events. 196/2404 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14944 event pairs, 92 based on Foata normal form. 0/2237 useless extension candidates. Maximal degree in co-relation 3035. Up to 332 conditions per place. [2025-01-09 21:34:34,214 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 33 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2025-01-09 21:34:34,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 447 transitions, 1126 flow [2025-01-09 21:34:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:34,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:34,216 INFO L175 Difference]: Start difference. First operand has 445 places, 447 transitions, 1055 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:34,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 447 transitions, 1126 flow [2025-01-09 21:34:34,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 447 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:34,221 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 1053 flow [2025-01-09 21:34:34,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2025-01-09 21:34:34,222 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -49 predicate places. [2025-01-09 21:34:34,222 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 1053 flow [2025-01-09 21:34:34,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.6666666666667) internal successors, (1454), 3 states have internal predecessors, (1454), 0 states have call successors, (0), 0 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,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:34,222 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:34,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:34:34,222 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] === [2025-01-09 21:34:34,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash 141942176, now seen corresponding path program 1 times [2025-01-09 21:34:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:34,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655534531] [2025-01-09 21:34:34,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:34,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 21:34:34,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 21:34:34,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:34,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:34,269 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,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655534531] [2025-01-09 21:34:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655534531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091583199] [2025-01-09 21:34:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:34,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:34,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:34,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:34,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 532 [2025-01-09 21:34:34,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 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,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:34,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 532 [2025-01-09 21:34:34,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:34,519 INFO L124 PetriNetUnfolderBase]: 195/2365 cut-off events. [2025-01-09 21:34:34,520 INFO L125 PetriNetUnfolderBase]: For 233/234 co-relation queries the response was YES. [2025-01-09 21:34:34,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 2365 events. 195/2365 cut-off events. For 233/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14622 event pairs, 92 based on Foata normal form. 0/2204 useless extension candidates. Maximal degree in co-relation 2996. Up to 332 conditions per place. [2025-01-09 21:34:34,533 INFO L140 encePairwiseOnDemand]: 529/532 looper letters, 0 selfloop transitions, 0 changer transitions 446/446 dead transitions. [2025-01-09 21:34:34,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 446 transitions, 1124 flow [2025-01-09 21:34:34,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:34:34,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924812030075188 [2025-01-09 21:34:34,535 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 1053 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:34:34,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 446 transitions, 1124 flow [2025-01-09 21:34:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 446 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:34,539 INFO L231 Difference]: Finished difference. Result has 443 places, 0 transitions, 0 flow [2025-01-09 21:34:34,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=532, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=443, PETRI_TRANSITIONS=0} [2025-01-09 21:34:34,540 INFO L279 CegarLoopForPetriNet]: 493 programPoint places, -50 predicate places. [2025-01-09 21:34:34,540 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 0 transitions, 0 flow [2025-01-09 21:34:34,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 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,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (131 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (130 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (128 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (126 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (125 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (123 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (122 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (121 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (120 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (119 of 132 remaining) [2025-01-09 21:34:34,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (118 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (117 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (116 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (115 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (113 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (112 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (111 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (110 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (109 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (108 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (107 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (106 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (105 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (104 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (103 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (102 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (101 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (99 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (98 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (97 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (96 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (95 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (94 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (93 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (92 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (91 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (90 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (89 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (88 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (87 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (86 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (85 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (84 of 132 remaining) [2025-01-09 21:34:34,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (83 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (82 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (81 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (80 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (79 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (78 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (77 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (76 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (75 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (74 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (73 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (72 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (71 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (70 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (69 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (67 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (66 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (64 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (63 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (62 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (57 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (56 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (55 of 132 remaining) [2025-01-09 21:34:34,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (54 of 132 remaining) [2025-01-09 21:34:34,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (53 of 132 remaining) [2025-01-09 21:34:34,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (52 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (51 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (49 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (48 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (47 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err45ASSERT_VIOLATIONDATA_RACE (46 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (44 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (42 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err46ASSERT_VIOLATIONDATA_RACE (41 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (40 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (39 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err47ASSERT_VIOLATIONDATA_RACE (38 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (36 of 132 remaining) [2025-01-09 21:34:34,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err48ASSERT_VIOLATIONDATA_RACE (35 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (33 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (32 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (31 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err49ASSERT_VIOLATIONDATA_RACE (30 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (28 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err50ASSERT_VIOLATIONDATA_RACE (27 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err43ASSERT_VIOLATIONDATA_RACE (26 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (24 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err51ASSERT_VIOLATIONDATA_RACE (23 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err44ASSERT_VIOLATIONDATA_RACE (22 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err52ASSERT_VIOLATIONDATA_RACE (21 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (19 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (18 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (17 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (16 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (13 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (12 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (11 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (10 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (9 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (8 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (7 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (6 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (5 of 132 remaining) [2025-01-09 21:34:34,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (4 of 132 remaining) [2025-01-09 21:34:34,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (3 of 132 remaining) [2025-01-09 21:34:34,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (2 of 132 remaining) [2025-01-09 21:34:34,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (1 of 132 remaining) [2025-01-09 21:34:34,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (0 of 132 remaining) [2025-01-09 21:34:34,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:34:34,555 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] [2025-01-09 21:34:34,560 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:34,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:34,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:34 BasicIcfg [2025-01-09 21:34:34,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:34,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:34,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:34,564 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:34,565 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:25" (3/4) ... [2025-01-09 21:34:34,566 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:34,568 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:34,568 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:34,570 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 21:34:34,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:34,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:34,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:34,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:34,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:34,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:34,631 INFO L158 Benchmark]: Toolchain (without parser) took 10314.65ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 111.0MB in the beginning and 428.5MB in the end (delta: -317.5MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:34,632 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:34,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.36ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:34:34,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:34,632 INFO L158 Benchmark]: Boogie Preprocessor took 30.97ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:34,632 INFO L158 Benchmark]: RCFGBuilder took 714.27ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 54.0MB in the end (delta: 38.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:34:34,632 INFO L158 Benchmark]: TraceAbstraction took 9216.39ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 53.0MB in the beginning and 436.9MB in the end (delta: -383.9MB). Peak memory consumption was 303.0MB. Max. memory is 16.1GB. [2025-01-09 21:34:34,633 INFO L158 Benchmark]: Witness Printer took 66.79ms. Allocated memory is still 604.0MB. Free memory was 436.9MB in the beginning and 428.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:34,634 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.36ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.97ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 714.27ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 54.0MB in the end (delta: 38.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9216.39ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 53.0MB in the beginning and 436.9MB in the end (delta: -383.9MB). Peak memory consumption was 303.0MB. Max. memory is 16.1GB. * Witness Printer took 66.79ms. Allocated memory is still 604.0MB. Free memory was 436.9MB in the beginning and 428.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 73]: 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: 74]: 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: 79]: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 881 locations, 132 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: 9.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3150 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1196 mSDsluCounter, 549 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3374 IncrementalHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 444 mSDtfsCounter, 3374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=15, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2225 NumberOfCodeBlocks, 2225 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2203 ConstructedInterpolants, 0 QuantifiedInterpolants, 3062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 69 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:34,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE