./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-subst.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 e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:17,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:18,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:18,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:18,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:18,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:18,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:18,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:18,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:18,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:18,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:18,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:18,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:18,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:18,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:18,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:18,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:18,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:18,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:18,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:18,071 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 -> e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 [2025-01-09 21:30:18,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:18,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:18,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:18,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:18,272 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:18,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-01-09 21:30:19,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcd35a71d/616c49c4fd544f0194e44bd474dec83c/FLAG33d40ae1c [2025-01-09 21:30:19,706 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:19,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-01-09 21:30:19,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcd35a71d/616c49c4fd544f0194e44bd474dec83c/FLAG33d40ae1c [2025-01-09 21:30:20,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcd35a71d/616c49c4fd544f0194e44bd474dec83c [2025-01-09 21:30:20,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:20,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:20,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:20,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:20,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:20,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300c189d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20, skipping insertion in model container [2025-01-09 21:30:20,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:20,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:20,238 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:20,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:20,280 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:20,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20 WrapperNode [2025-01-09 21:30:20,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:20,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:20,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:20,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:20,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,326 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 19, calls inlined = 41, statements flattened = 545 [2025-01-09 21:30:20,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:20,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:20,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:20,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:20,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:20,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:20,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:20,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:20,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (1/1) ... [2025-01-09 21:30:20,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:20,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:20,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:20,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:30:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:20,429 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:20,528 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:20,530 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:21,091 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:21,091 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:21,869 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:21,869 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:21,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:21 BoogieIcfgContainer [2025-01-09 21:30:21,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:21,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:21,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:21,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:21,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:20" (1/3) ... [2025-01-09 21:30:21,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640e53dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:21, skipping insertion in model container [2025-01-09 21:30:21,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:20" (2/3) ... [2025-01-09 21:30:21,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640e53dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:21, skipping insertion in model container [2025-01-09 21:30:21,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:21" (3/3) ... [2025-01-09 21:30:21,878 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2025-01-09 21:30:21,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:21,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-subst.wvr.c that has 4 procedures, 266 locations, 1 initial locations, 0 loop locations, and 71 error locations. [2025-01-09 21:30:21,892 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:21,987 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:22,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 268 transitions, 557 flow [2025-01-09 21:30:22,102 INFO L124 PetriNetUnfolderBase]: 3/265 cut-off events. [2025-01-09 21:30:22,104 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 265 events. 3/265 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 389 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2025-01-09 21:30:22,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 268 transitions, 557 flow [2025-01-09 21:30:22,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 245 transitions, 508 flow [2025-01-09 21:30:22,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:22,132 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;@3a8fca92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:22,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 128 error locations. [2025-01-09 21:30:22,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:22,139 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:30:22,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:22,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,140 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:30:22,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash -624486676, now seen corresponding path program 1 times [2025-01-09 21:30:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465717641] [2025-01-09 21:30:22,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:30:22,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:30:22,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465717641] [2025-01-09 21:30:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465717641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293358290] [2025-01-09 21:30:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:22,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 245 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:22,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,471 INFO L124 PetriNetUnfolderBase]: 15/236 cut-off events. [2025-01-09 21:30:22,472 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:30:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 236 events. 15/236 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 183. Up to 40 conditions per place. [2025-01-09 21:30:22,474 INFO L140 encePairwiseOnDemand]: 210/268 looper letters, 12 selfloop transitions, 2 changer transitions 1/189 dead transitions. [2025-01-09 21:30:22,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 189 transitions, 424 flow [2025-01-09 21:30:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-01-09 21:30:22,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8146766169154229 [2025-01-09 21:30:22,498 INFO L175 Difference]: Start difference. First operand has 254 places, 245 transitions, 508 flow. Second operand 3 states and 655 transitions. [2025-01-09 21:30:22,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 189 transitions, 424 flow [2025-01-09 21:30:22,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 189 transitions, 412 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:22,508 INFO L231 Difference]: Finished difference. Result has 195 places, 188 transitions, 386 flow [2025-01-09 21:30:22,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=195, PETRI_TRANSITIONS=188} [2025-01-09 21:30:22,515 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -59 predicate places. [2025-01-09 21:30:22,515 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 188 transitions, 386 flow [2025-01-09 21:30:22,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,516 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] [2025-01-09 21:30:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:22,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:22,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash -105975830, now seen corresponding path program 1 times [2025-01-09 21:30:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255367161] [2025-01-09 21:30:22,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:30:22,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:30:22,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255367161] [2025-01-09 21:30:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255367161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814848521] [2025-01-09 21:30:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:22,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 188 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:22,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,676 INFO L124 PetriNetUnfolderBase]: 15/234 cut-off events. [2025-01-09 21:30:22,676 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:22,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 234 events. 15/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 217 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 247. Up to 40 conditions per place. [2025-01-09 21:30:22,678 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-01-09 21:30:22,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 187 transitions, 412 flow [2025-01-09 21:30:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:22,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:22,680 INFO L175 Difference]: Start difference. First operand has 195 places, 188 transitions, 386 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:22,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 187 transitions, 412 flow [2025-01-09 21:30:22,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 187 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:22,686 INFO L231 Difference]: Finished difference. Result has 193 places, 187 transitions, 384 flow [2025-01-09 21:30:22,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=193, PETRI_TRANSITIONS=187} [2025-01-09 21:30:22,687 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -61 predicate places. [2025-01-09 21:30:22,687 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 187 transitions, 384 flow [2025-01-09 21:30:22,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,688 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] [2025-01-09 21:30:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:22,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1164072643, now seen corresponding path program 1 times [2025-01-09 21:30:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624522883] [2025-01-09 21:30:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:30:22,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:30:22,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624522883] [2025-01-09 21:30:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624522883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766784904] [2025-01-09 21:30:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:22,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:22,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,849 INFO L124 PetriNetUnfolderBase]: 15/233 cut-off events. [2025-01-09 21:30:22,849 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:22,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 233 events. 15/233 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 238. Up to 40 conditions per place. [2025-01-09 21:30:22,850 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-01-09 21:30:22,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 186 transitions, 410 flow [2025-01-09 21:30:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:22,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:22,852 INFO L175 Difference]: Start difference. First operand has 193 places, 187 transitions, 384 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:22,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 186 transitions, 410 flow [2025-01-09 21:30:22,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 186 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:22,857 INFO L231 Difference]: Finished difference. Result has 192 places, 186 transitions, 382 flow [2025-01-09 21:30:22,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=192, PETRI_TRANSITIONS=186} [2025-01-09 21:30:22,858 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -62 predicate places. [2025-01-09 21:30:22,858 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 186 transitions, 382 flow [2025-01-09 21:30:22,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,860 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] [2025-01-09 21:30:22,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:22,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash 240814812, now seen corresponding path program 1 times [2025-01-09 21:30:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004871920] [2025-01-09 21:30:22,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:30:22,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:30:22,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:22,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004871920] [2025-01-09 21:30:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004871920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645922896] [2025-01-09 21:30:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:22,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 186 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:22,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,990 INFO L124 PetriNetUnfolderBase]: 15/232 cut-off events. [2025-01-09 21:30:22,990 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:22,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 232 events. 15/232 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 229. Up to 40 conditions per place. [2025-01-09 21:30:22,991 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-01-09 21:30:22,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 185 transitions, 408 flow [2025-01-09 21:30:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:22,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:22,993 INFO L175 Difference]: Start difference. First operand has 192 places, 186 transitions, 382 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:22,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 185 transitions, 408 flow [2025-01-09 21:30:22,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 185 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:22,996 INFO L231 Difference]: Finished difference. Result has 191 places, 185 transitions, 380 flow [2025-01-09 21:30:22,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=191, PETRI_TRANSITIONS=185} [2025-01-09 21:30:22,996 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -63 predicate places. [2025-01-09 21:30:22,997 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 185 transitions, 380 flow [2025-01-09 21:30:22,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:22,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:22,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:22,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1104688112, now seen corresponding path program 1 times [2025-01-09 21:30:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603556284] [2025-01-09 21:30:22,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:30:23,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:30:23,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603556284] [2025-01-09 21:30:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603556284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004629105] [2025-01-09 21:30:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,092 INFO L124 PetriNetUnfolderBase]: 15/231 cut-off events. [2025-01-09 21:30:23,092 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 231 events. 15/231 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 220. Up to 40 conditions per place. [2025-01-09 21:30:23,093 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2025-01-09 21:30:23,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 184 transitions, 406 flow [2025-01-09 21:30:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,095 INFO L175 Difference]: Start difference. First operand has 191 places, 185 transitions, 380 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 184 transitions, 406 flow [2025-01-09 21:30:23,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 184 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,097 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 378 flow [2025-01-09 21:30:23,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2025-01-09 21:30:23,098 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -64 predicate places. [2025-01-09 21:30:23,098 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 378 flow [2025-01-09 21:30:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:23,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2003497406, now seen corresponding path program 1 times [2025-01-09 21:30:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120421911] [2025-01-09 21:30:23,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:30:23,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:30:23,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120421911] [2025-01-09 21:30:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120421911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121518391] [2025-01-09 21:30:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,229 INFO L124 PetriNetUnfolderBase]: 15/230 cut-off events. [2025-01-09 21:30:23,230 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 230 events. 15/230 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 211. Up to 40 conditions per place. [2025-01-09 21:30:23,231 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-01-09 21:30:23,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 404 flow [2025-01-09 21:30:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,233 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 378 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 404 flow [2025-01-09 21:30:23,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 183 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,236 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 376 flow [2025-01-09 21:30:23,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2025-01-09 21:30:23,239 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -65 predicate places. [2025-01-09 21:30:23,239 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 376 flow [2025-01-09 21:30:23,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,240 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:30:23,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:23,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1238292759, now seen corresponding path program 1 times [2025-01-09 21:30:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784442352] [2025-01-09 21:30:23,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:30:23,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:30:23,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784442352] [2025-01-09 21:30:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784442352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051133803] [2025-01-09 21:30:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,394 INFO L124 PetriNetUnfolderBase]: 15/229 cut-off events. [2025-01-09 21:30:23,395 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 229 events. 15/229 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 202. Up to 40 conditions per place. [2025-01-09 21:30:23,395 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-01-09 21:30:23,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 402 flow [2025-01-09 21:30:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,397 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 376 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 402 flow [2025-01-09 21:30:23,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,399 INFO L231 Difference]: Finished difference. Result has 188 places, 182 transitions, 374 flow [2025-01-09 21:30:23,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=188, PETRI_TRANSITIONS=182} [2025-01-09 21:30:23,399 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -66 predicate places. [2025-01-09 21:30:23,399 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 182 transitions, 374 flow [2025-01-09 21:30:23,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,400 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] [2025-01-09 21:30:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:23,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1800171798, now seen corresponding path program 1 times [2025-01-09 21:30:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79433066] [2025-01-09 21:30:23,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:30:23,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:30:23,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79433066] [2025-01-09 21:30:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79433066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290004771] [2025-01-09 21:30:23,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 182 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,489 INFO L124 PetriNetUnfolderBase]: 15/228 cut-off events. [2025-01-09 21:30:23,489 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 228 events. 15/228 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 193. Up to 40 conditions per place. [2025-01-09 21:30:23,494 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-01-09 21:30:23,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 181 transitions, 400 flow [2025-01-09 21:30:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,496 INFO L175 Difference]: Start difference. First operand has 188 places, 182 transitions, 374 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 181 transitions, 400 flow [2025-01-09 21:30:23,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 181 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,498 INFO L231 Difference]: Finished difference. Result has 187 places, 181 transitions, 372 flow [2025-01-09 21:30:23,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=187, PETRI_TRANSITIONS=181} [2025-01-09 21:30:23,500 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -67 predicate places. [2025-01-09 21:30:23,500 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 181 transitions, 372 flow [2025-01-09 21:30:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,501 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] [2025-01-09 21:30:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:23,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,501 INFO L85 PathProgramCache]: Analyzing trace with hash 717617742, now seen corresponding path program 1 times [2025-01-09 21:30:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403928804] [2025-01-09 21:30:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:30:23,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:30:23,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403928804] [2025-01-09 21:30:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403928804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917816803] [2025-01-09 21:30:23,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 181 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,617 INFO L124 PetriNetUnfolderBase]: 15/227 cut-off events. [2025-01-09 21:30:23,618 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 227 events. 15/227 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 184. Up to 40 conditions per place. [2025-01-09 21:30:23,618 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-01-09 21:30:23,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 180 transitions, 398 flow [2025-01-09 21:30:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,620 INFO L175 Difference]: Start difference. First operand has 187 places, 181 transitions, 372 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 180 transitions, 398 flow [2025-01-09 21:30:23,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 180 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,621 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 370 flow [2025-01-09 21:30:23,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=186, PETRI_TRANSITIONS=180} [2025-01-09 21:30:23,622 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -68 predicate places. [2025-01-09 21:30:23,622 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 370 flow [2025-01-09 21:30:23,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,623 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] [2025-01-09 21:30:23,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:23,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1175417741, now seen corresponding path program 1 times [2025-01-09 21:30:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511053765] [2025-01-09 21:30:23,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:30:23,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:30:23,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511053765] [2025-01-09 21:30:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511053765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954410342] [2025-01-09 21:30:23,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,739 INFO L124 PetriNetUnfolderBase]: 15/226 cut-off events. [2025-01-09 21:30:23,739 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 226 events. 15/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 175. Up to 40 conditions per place. [2025-01-09 21:30:23,739 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2025-01-09 21:30:23,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 179 transitions, 396 flow [2025-01-09 21:30:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,741 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 370 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 179 transitions, 396 flow [2025-01-09 21:30:23,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 179 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,743 INFO L231 Difference]: Finished difference. Result has 185 places, 179 transitions, 368 flow [2025-01-09 21:30:23,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=185, PETRI_TRANSITIONS=179} [2025-01-09 21:30:23,743 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -69 predicate places. [2025-01-09 21:30:23,743 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 179 transitions, 368 flow [2025-01-09 21:30:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,744 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] [2025-01-09 21:30:23,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:23,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1354624120, now seen corresponding path program 1 times [2025-01-09 21:30:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089597147] [2025-01-09 21:30:23,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:30:23,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:30:23,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089597147] [2025-01-09 21:30:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089597147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003461097] [2025-01-09 21:30:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 179 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,812 INFO L124 PetriNetUnfolderBase]: 15/225 cut-off events. [2025-01-09 21:30:23,812 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 225 events. 15/225 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 166. Up to 40 conditions per place. [2025-01-09 21:30:23,813 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-01-09 21:30:23,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 178 transitions, 394 flow [2025-01-09 21:30:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,814 INFO L175 Difference]: Start difference. First operand has 185 places, 179 transitions, 368 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 178 transitions, 394 flow [2025-01-09 21:30:23,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,816 INFO L231 Difference]: Finished difference. Result has 184 places, 178 transitions, 366 flow [2025-01-09 21:30:23,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=184, PETRI_TRANSITIONS=178} [2025-01-09 21:30:23,817 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -70 predicate places. [2025-01-09 21:30:23,817 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 178 transitions, 366 flow [2025-01-09 21:30:23,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,817 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:30:23,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:23,817 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1867447145, now seen corresponding path program 1 times [2025-01-09 21:30:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826031942] [2025-01-09 21:30:23,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:30:23,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:30:23,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826031942] [2025-01-09 21:30:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826031942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129805988] [2025-01-09 21:30:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:23,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 268 [2025-01-09 21:30:23,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 178 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 268 [2025-01-09 21:30:23,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,891 INFO L124 PetriNetUnfolderBase]: 15/224 cut-off events. [2025-01-09 21:30:23,891 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 224 events. 15/224 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 206 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 157. Up to 40 conditions per place. [2025-01-09 21:30:23,892 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2025-01-09 21:30:23,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 177 transitions, 392 flow [2025-01-09 21:30:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-01-09 21:30:23,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2025-01-09 21:30:23,893 INFO L175 Difference]: Start difference. First operand has 184 places, 178 transitions, 366 flow. Second operand 3 states and 600 transitions. [2025-01-09 21:30:23,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 177 transitions, 392 flow [2025-01-09 21:30:23,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 177 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:23,895 INFO L231 Difference]: Finished difference. Result has 183 places, 177 transitions, 364 flow [2025-01-09 21:30:23,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=183, PETRI_TRANSITIONS=177} [2025-01-09 21:30:23,896 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -71 predicate places. [2025-01-09 21:30:23,896 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 177 transitions, 364 flow [2025-01-09 21:30:23,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:23,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:23,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:23,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash -450110950, now seen corresponding path program 1 times [2025-01-09 21:30:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152081669] [2025-01-09 21:30:23,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:30:23,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:30:23,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152081669] [2025-01-09 21:30:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152081669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015076073] [2025-01-09 21:30:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 268 [2025-01-09 21:30:24,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 177 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 268 [2025-01-09 21:30:24,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,087 INFO L124 PetriNetUnfolderBase]: 15/223 cut-off events. [2025-01-09 21:30:24,087 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:24,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 223 events. 15/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 204 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 146. Up to 37 conditions per place. [2025-01-09 21:30:24,088 INFO L140 encePairwiseOnDemand]: 266/268 looper letters, 10 selfloop transitions, 1 changer transitions 0/176 dead transitions. [2025-01-09 21:30:24,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 384 flow [2025-01-09 21:30:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2025-01-09 21:30:24,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7574626865671642 [2025-01-09 21:30:24,089 INFO L175 Difference]: Start difference. First operand has 183 places, 177 transitions, 364 flow. Second operand 3 states and 609 transitions. [2025-01-09 21:30:24,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 176 transitions, 384 flow [2025-01-09 21:30:24,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 176 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,092 INFO L231 Difference]: Finished difference. Result has 182 places, 176 transitions, 360 flow [2025-01-09 21:30:24,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=182, PETRI_TRANSITIONS=176} [2025-01-09 21:30:24,092 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -72 predicate places. [2025-01-09 21:30:24,093 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 176 transitions, 360 flow [2025-01-09 21:30:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,093 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] [2025-01-09 21:30:24,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:24,094 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash -864853272, now seen corresponding path program 1 times [2025-01-09 21:30:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10332244] [2025-01-09 21:30:24,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:30:24,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:30:24,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10332244] [2025-01-09 21:30:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10332244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597703347] [2025-01-09 21:30:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 268 [2025-01-09 21:30:24,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 268 [2025-01-09 21:30:24,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,252 INFO L124 PetriNetUnfolderBase]: 15/221 cut-off events. [2025-01-09 21:30:24,252 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:24,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 221 events. 15/221 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 245. Up to 37 conditions per place. [2025-01-09 21:30:24,253 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 1 changer transitions 0/174 dead transitions. [2025-01-09 21:30:24,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 174 transitions, 382 flow [2025-01-09 21:30:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-01-09 21:30:24,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-09 21:30:24,255 INFO L175 Difference]: Start difference. First operand has 182 places, 176 transitions, 360 flow. Second operand 3 states and 603 transitions. [2025-01-09 21:30:24,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 174 transitions, 382 flow [2025-01-09 21:30:24,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 174 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:24,259 INFO L231 Difference]: Finished difference. Result has 181 places, 174 transitions, 357 flow [2025-01-09 21:30:24,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=181, PETRI_TRANSITIONS=174} [2025-01-09 21:30:24,260 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -73 predicate places. [2025-01-09 21:30:24,260 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 174 transitions, 357 flow [2025-01-09 21:30:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,261 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] [2025-01-09 21:30:24,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:24,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-01-09 21:30:24,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1006809697, now seen corresponding path program 1 times [2025-01-09 21:30:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101535879] [2025-01-09 21:30:24,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:30:24,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:30:24,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101535879] [2025-01-09 21:30:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101535879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514850006] [2025-01-09 21:30:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:24,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 268 [2025-01-09 21:30:24,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 174 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 268 [2025-01-09 21:30:24,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,406 INFO L124 PetriNetUnfolderBase]: 15/219 cut-off events. [2025-01-09 21:30:24,407 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:24,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 219 events. 15/219 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 199 event pairs, 15 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 254. Up to 37 conditions per place. [2025-01-09 21:30:24,407 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 0 selfloop transitions, 0 changer transitions 172/172 dead transitions. [2025-01-09 21:30:24,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 172 transitions, 377 flow [2025-01-09 21:30:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2025-01-09 21:30:24,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7487562189054726 [2025-01-09 21:30:24,409 INFO L175 Difference]: Start difference. First operand has 181 places, 174 transitions, 357 flow. Second operand 3 states and 602 transitions. [2025-01-09 21:30:24,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 172 transitions, 377 flow [2025-01-09 21:30:24,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 172 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:24,411 INFO L231 Difference]: Finished difference. Result has 180 places, 0 transitions, 0 flow [2025-01-09 21:30:24,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=180, PETRI_TRANSITIONS=0} [2025-01-09 21:30:24,411 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -74 predicate places. [2025-01-09 21:30:24,411 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 0 transitions, 0 flow [2025-01-09 21:30:24,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (127 of 128 remaining) [2025-01-09 21:30:24,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (126 of 128 remaining) [2025-01-09 21:30:24,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (125 of 128 remaining) [2025-01-09 21:30:24,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (124 of 128 remaining) [2025-01-09 21:30:24,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (123 of 128 remaining) [2025-01-09 21:30:24,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (122 of 128 remaining) [2025-01-09 21:30:24,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (121 of 128 remaining) [2025-01-09 21:30:24,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (120 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (119 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (118 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (115 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (114 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (113 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (110 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (109 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (108 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (107 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (106 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (105 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (104 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (103 of 128 remaining) [2025-01-09 21:30:24,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (102 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (101 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (100 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (99 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (98 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (97 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (96 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (95 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (94 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (93 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (92 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (91 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (90 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (89 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (88 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (87 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (86 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (85 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (84 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (82 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (81 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (80 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (79 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (78 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (77 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (76 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (75 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (74 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (73 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (72 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (71 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (70 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (69 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (68 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (67 of 128 remaining) [2025-01-09 21:30:24,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (66 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (65 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (64 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (63 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (62 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (61 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (60 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (59 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (58 of 128 remaining) [2025-01-09 21:30:24,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (57 of 128 remaining) [2025-01-09 21:30:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 128 remaining) [2025-01-09 21:30:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 128 remaining) [2025-01-09 21:30:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 128 remaining) [2025-01-09 21:30:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 128 remaining) [2025-01-09 21:30:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (52 of 128 remaining) [2025-01-09 21:30:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (43 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (41 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (40 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (39 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (37 of 128 remaining) [2025-01-09 21:30:24,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (26 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (21 of 128 remaining) [2025-01-09 21:30:24,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (20 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (19 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (13 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (8 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 128 remaining) [2025-01-09 21:30:24,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 128 remaining) [2025-01-09 21:30:24,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (3 of 128 remaining) [2025-01-09 21:30:24,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (2 of 128 remaining) [2025-01-09 21:30:24,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (1 of 128 remaining) [2025-01-09 21:30:24,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 128 remaining) [2025-01-09 21:30:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:24,424 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:24,428 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:24,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:24,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:24 BasicIcfg [2025-01-09 21:30:24,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:24,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:24,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:24,436 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:24,436 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:21" (3/4) ... [2025-01-09 21:30:24,437 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:24,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:24,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:24,439 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:24,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 21:30:24,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:24,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:24,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:24,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:24,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:24,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:24,514 INFO L158 Benchmark]: Toolchain (without parser) took 4444.86ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 124.9MB in the beginning and 206.3MB in the end (delta: -81.3MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2025-01-09 21:30:24,514 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:24,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.02ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 111.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:24,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.95ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 108.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:24,515 INFO L158 Benchmark]: Boogie Preprocessor took 50.69ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:24,516 INFO L158 Benchmark]: RCFGBuilder took 1487.63ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 106.0MB in the end (delta: 512.7kB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2025-01-09 21:30:24,516 INFO L158 Benchmark]: TraceAbstraction took 2564.72ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 104.8MB in the beginning and 210.4MB in the end (delta: -105.7MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. [2025-01-09 21:30:24,516 INFO L158 Benchmark]: Witness Printer took 77.79ms. Allocated memory is still 436.2MB. Free memory was 210.4MB in the beginning and 206.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:24,518 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.28ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.02ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 111.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.95ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 108.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.69ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1487.63ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 106.0MB in the end (delta: 512.7kB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2564.72ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 104.8MB in the beginning and 210.4MB in the end (delta: -105.7MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. * Witness Printer took 77.79ms. Allocated memory is still 436.2MB. Free memory was 210.4MB in the beginning and 206.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 69]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 338 locations, 128 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 23 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 1416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:24,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE