./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.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/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:43,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:43,972 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:29:43,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:43,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:44,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:44,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:44,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:44,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:44,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:44,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:44,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:44,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:44,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:44,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:44,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:44,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:44,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:44,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:44,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:44,014 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2025-01-09 21:29:44,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:44,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:44,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:44,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:44,403 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:44,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-01-09 21:29:45,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e69708da/a3eaf0d1fb4e4b22b0e784217daec824/FLAG3390ef388 [2025-01-09 21:29:45,895 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:45,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-01-09 21:29:45,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e69708da/a3eaf0d1fb4e4b22b0e784217daec824/FLAG3390ef388 [2025-01-09 21:29:46,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e69708da/a3eaf0d1fb4e4b22b0e784217daec824 [2025-01-09 21:29:46,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:46,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:46,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:46,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:46,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:46,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a61d4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46, skipping insertion in model container [2025-01-09 21:29:46,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:46,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:46,386 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:46,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:46,428 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:46,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46 WrapperNode [2025-01-09 21:29:46,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:46,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:46,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:46,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:46,434 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:29:46" (1/1) ... [2025-01-09 21:29:46,444 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:29:46" (1/1) ... [2025-01-09 21:29:46,462 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 21:29:46,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:46,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:46,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:46,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:46,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:46,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:46,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:46,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:46,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (1/1) ... [2025-01-09 21:29:46,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:46,539 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:29:46,545 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:29:46,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:46,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:46,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:46,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:46,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:46,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:46,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:29:46,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:29:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:46,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:46,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:46,565 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:29:46,652 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:46,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:47,011 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:47,011 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:47,024 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:47,024 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:29:47,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:47 BoogieIcfgContainer [2025-01-09 21:29:47,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:47,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:47,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:47,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:47,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:46" (1/3) ... [2025-01-09 21:29:47,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774150c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:47, skipping insertion in model container [2025-01-09 21:29:47,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:46" (2/3) ... [2025-01-09 21:29:47,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774150c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:47, skipping insertion in model container [2025-01-09 21:29:47,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:47" (3/3) ... [2025-01-09 21:29:47,032 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-01-09 21:29:47,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:47,052 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 390 locations, 1 initial locations, 4 loop locations, and 71 error locations. [2025-01-09 21:29:47,052 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:47,140 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:29:47,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 403 transitions, 834 flow [2025-01-09 21:29:47,302 INFO L124 PetriNetUnfolderBase]: 14/399 cut-off events. [2025-01-09 21:29:47,304 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:47,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 399 events. 14/399 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1156 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 305. Up to 2 conditions per place. [2025-01-09 21:29:47,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 403 transitions, 834 flow [2025-01-09 21:29:47,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 379 transitions, 782 flow [2025-01-09 21:29:47,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:47,331 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;@763e314c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:47,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2025-01-09 21:29:47,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:47,336 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:29:47,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:47,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:47,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:47,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1452873591, now seen corresponding path program 1 times [2025-01-09 21:29:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129399325] [2025-01-09 21:29:47,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:29:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:29:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,439 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:29:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129399325] [2025-01-09 21:29:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129399325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416737586] [2025-01-09 21:29:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2025-01-09 21:29:47,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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:29:47,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2025-01-09 21:29:47,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,671 INFO L124 PetriNetUnfolderBase]: 49/589 cut-off events. [2025-01-09 21:29:47,672 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-09 21:29:47,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 589 events. 49/589 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2880 event pairs, 39 based on Foata normal form. 91/555 useless extension candidates. Maximal degree in co-relation 653. Up to 109 conditions per place. [2025-01-09 21:29:47,682 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 27 selfloop transitions, 2 changer transitions 1/373 dead transitions. [2025-01-09 21:29:47,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 373 transitions, 828 flow [2025-01-09 21:29:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:29:47,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346567411083541 [2025-01-09 21:29:47,697 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 782 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:29:47,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 373 transitions, 828 flow [2025-01-09 21:29:47,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 373 transitions, 812 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:29:47,707 INFO L231 Difference]: Finished difference. Result has 373 places, 372 transitions, 756 flow [2025-01-09 21:29:47,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=373, PETRI_TRANSITIONS=372} [2025-01-09 21:29:47,711 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-01-09 21:29:47,711 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 372 transitions, 756 flow [2025-01-09 21:29:47,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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:29:47,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,712 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] [2025-01-09 21:29:47,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:47,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1830270264, now seen corresponding path program 1 times [2025-01-09 21:29:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058745738] [2025-01-09 21:29:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:29:47,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:29:47,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,739 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:29:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058745738] [2025-01-09 21:29:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058745738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284159158] [2025-01-09 21:29:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2025-01-09 21:29:47,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 372 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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:29:47,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2025-01-09 21:29:47,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,916 INFO L124 PetriNetUnfolderBase]: 49/587 cut-off events. [2025-01-09 21:29:47,916 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:29:47,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 587 events. 49/587 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2948 event pairs, 39 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 701. Up to 108 conditions per place. [2025-01-09 21:29:47,926 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-01-09 21:29:47,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 371 transitions, 810 flow [2025-01-09 21:29:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-01-09 21:29:47,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2025-01-09 21:29:47,929 INFO L175 Difference]: Start difference. First operand has 373 places, 372 transitions, 756 flow. Second operand 3 states and 1127 transitions. [2025-01-09 21:29:47,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 371 transitions, 810 flow [2025-01-09 21:29:47,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 371 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,935 INFO L231 Difference]: Finished difference. Result has 371 places, 371 transitions, 754 flow [2025-01-09 21:29:47,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=371} [2025-01-09 21:29:47,936 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-01-09 21:29:47,936 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 371 transitions, 754 flow [2025-01-09 21:29:47,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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:29:47,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,937 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] [2025-01-09 21:29:47,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:47,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -454455376, now seen corresponding path program 1 times [2025-01-09 21:29:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194994344] [2025-01-09 21:29:47,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:29:47,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:29:47,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,967 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:29:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194994344] [2025-01-09 21:29:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194994344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710907818] [2025-01-09 21:29:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2025-01-09 21:29:48,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 371 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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:29:48,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2025-01-09 21:29:48,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,125 INFO L124 PetriNetUnfolderBase]: 49/541 cut-off events. [2025-01-09 21:29:48,125 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-09 21:29:48,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 541 events. 49/541 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2540 event pairs, 39 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 636. Up to 109 conditions per place. [2025-01-09 21:29:48,134 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-01-09 21:29:48,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 810 flow [2025-01-09 21:29:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2025-01-09 21:29:48,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305210918114144 [2025-01-09 21:29:48,136 INFO L175 Difference]: Start difference. First operand has 371 places, 371 transitions, 754 flow. Second operand 3 states and 1125 transitions. [2025-01-09 21:29:48,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 810 flow [2025-01-09 21:29:48,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:48,141 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 752 flow [2025-01-09 21:29:48,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2025-01-09 21:29:48,142 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-01-09 21:29:48,142 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 752 flow [2025-01-09 21:29:48,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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:29:48,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,142 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] [2025-01-09 21:29:48,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:48,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:48,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 344631959, now seen corresponding path program 1 times [2025-01-09 21:29:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781036557] [2025-01-09 21:29:48,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:29:48,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:29:48,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,178 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:29:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781036557] [2025-01-09 21:29:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781036557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588248172] [2025-01-09 21:29:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2025-01-09 21:29:48,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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:29:48,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2025-01-09 21:29:48,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,374 INFO L124 PetriNetUnfolderBase]: 49/495 cut-off events. [2025-01-09 21:29:48,374 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-09 21:29:48,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 495 events. 49/495 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2071 event pairs, 39 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 569. Up to 108 conditions per place. [2025-01-09 21:29:48,383 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-01-09 21:29:48,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 806 flow [2025-01-09 21:29:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-01-09 21:29:48,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2025-01-09 21:29:48,387 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 752 flow. Second operand 3 states and 1127 transitions. [2025-01-09 21:29:48,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 806 flow [2025-01-09 21:29:48,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:48,392 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 750 flow [2025-01-09 21:29:48,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2025-01-09 21:29:48,393 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-01-09 21:29:48,394 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 750 flow [2025-01-09 21:29:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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:29:48,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,395 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] [2025-01-09 21:29:48,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:48,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1418518307, now seen corresponding path program 1 times [2025-01-09 21:29:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74822160] [2025-01-09 21:29:48,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:29:48,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:29:48,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,448 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:29:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74822160] [2025-01-09 21:29:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74822160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935246448] [2025-01-09 21:29:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 403 [2025-01-09 21:29:48,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 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:29:48,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 403 [2025-01-09 21:29:48,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,733 INFO L124 PetriNetUnfolderBase]: 102/2206 cut-off events. [2025-01-09 21:29:48,733 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:29:48,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 2206 events. 102/2206 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 18725 event pairs, 51 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2320. Up to 144 conditions per place. [2025-01-09 21:29:48,766 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-01-09 21:29:48,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 782 flow [2025-01-09 21:29:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2025-01-09 21:29:48,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503722084367245 [2025-01-09 21:29:48,772 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 750 flow. Second operand 3 states and 1149 transitions. [2025-01-09 21:29:48,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 782 flow [2025-01-09 21:29:48,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:48,776 INFO L231 Difference]: Finished difference. Result has 368 places, 368 transitions, 748 flow [2025-01-09 21:29:48,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=368, PETRI_TRANSITIONS=368} [2025-01-09 21:29:48,779 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2025-01-09 21:29:48,780 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 368 transitions, 748 flow [2025-01-09 21:29:48,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 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:29:48,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,782 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] [2025-01-09 21:29:48,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:48,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:48,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2022233180, now seen corresponding path program 1 times [2025-01-09 21:29:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381581158] [2025-01-09 21:29:48,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:29:48,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:29:48,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,809 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:29:48,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381581158] [2025-01-09 21:29:48,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381581158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20155166] [2025-01-09 21:29:48,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2025-01-09 21:29:48,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 368 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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:29:48,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2025-01-09 21:29:48,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,945 INFO L124 PetriNetUnfolderBase]: 76/573 cut-off events. [2025-01-09 21:29:48,946 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:48,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 573 events. 76/573 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2972 event pairs, 54 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 763. Up to 144 conditions per place. [2025-01-09 21:29:48,954 INFO L140 encePairwiseOnDemand]: 382/403 looper letters, 32 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-01-09 21:29:48,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 360 transitions, 817 flow [2025-01-09 21:29:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-01-09 21:29:48,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9048800661703887 [2025-01-09 21:29:48,956 INFO L175 Difference]: Start difference. First operand has 368 places, 368 transitions, 748 flow. Second operand 3 states and 1094 transitions. [2025-01-09 21:29:48,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 360 transitions, 817 flow [2025-01-09 21:29:48,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:48,962 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 751 flow [2025-01-09 21:29:48,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-01-09 21:29:48,963 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -23 predicate places. [2025-01-09 21:29:48,963 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 751 flow [2025-01-09 21:29:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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:29:48,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,964 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:29:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:48,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2040894576, now seen corresponding path program 1 times [2025-01-09 21:29:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402557933] [2025-01-09 21:29:48,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:29:48,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:29:48,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,990 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:29:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402557933] [2025-01-09 21:29:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402557933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544420000] [2025-01-09 21:29:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2025-01-09 21:29:49,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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:29:49,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2025-01-09 21:29:49,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,135 INFO L124 PetriNetUnfolderBase]: 76/563 cut-off events. [2025-01-09 21:29:49,135 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-09 21:29:49,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 76/563 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3012 event pairs, 54 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 694. Up to 142 conditions per place. [2025-01-09 21:29:49,143 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 30 selfloop transitions, 9 changer transitions 0/350 dead transitions. [2025-01-09 21:29:49,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 350 transitions, 818 flow [2025-01-09 21:29:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-01-09 21:29:49,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098428453267163 [2025-01-09 21:29:49,145 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 751 flow. Second operand 3 states and 1100 transitions. [2025-01-09 21:29:49,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 350 transitions, 818 flow [2025-01-09 21:29:49,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:49,149 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 751 flow [2025-01-09 21:29:49,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2025-01-09 21:29:49,150 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -32 predicate places. [2025-01-09 21:29:49,151 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 751 flow [2025-01-09 21:29:49,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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:29:49,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,151 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] [2025-01-09 21:29:49,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:49,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1254684885, now seen corresponding path program 1 times [2025-01-09 21:29:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857597716] [2025-01-09 21:29:49,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:29:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:29:49,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,184 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:29:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857597716] [2025-01-09 21:29:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857597716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793548474] [2025-01-09 21:29:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2025-01-09 21:29:49,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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:29:49,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2025-01-09 21:29:49,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,336 INFO L124 PetriNetUnfolderBase]: 83/744 cut-off events. [2025-01-09 21:29:49,336 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-01-09 21:29:49,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 744 events. 83/744 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4281 event pairs, 12 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 851. Up to 148 conditions per place. [2025-01-09 21:29:49,349 INFO L140 encePairwiseOnDemand]: 381/403 looper letters, 35 selfloop transitions, 10 changer transitions 0/343 dead transitions. [2025-01-09 21:29:49,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 343 transitions, 839 flow [2025-01-09 21:29:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1098 transitions. [2025-01-09 21:29:49,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9081885856079405 [2025-01-09 21:29:49,351 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 751 flow. Second operand 3 states and 1098 transitions. [2025-01-09 21:29:49,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 343 transitions, 839 flow [2025-01-09 21:29:49,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 343 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:49,356 INFO L231 Difference]: Finished difference. Result has 338 places, 337 transitions, 756 flow [2025-01-09 21:29:49,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=338, PETRI_TRANSITIONS=337} [2025-01-09 21:29:49,357 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -42 predicate places. [2025-01-09 21:29:49,357 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 337 transitions, 756 flow [2025-01-09 21:29:49,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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:29:49,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,358 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:29:49,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:49,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:49,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1133658259, now seen corresponding path program 1 times [2025-01-09 21:29:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583504800] [2025-01-09 21:29:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:29:49,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:29:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,408 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:29:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583504800] [2025-01-09 21:29:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583504800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:29:49,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50877105] [2025-01-09 21:29:49,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:29:49,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:29:49,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:29:49,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-01-09 21:29:49,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 337 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 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:29:49,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-01-09 21:29:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,513 INFO L124 PetriNetUnfolderBase]: 12/569 cut-off events. [2025-01-09 21:29:49,513 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:49,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 569 events. 12/569 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2413 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 474. Up to 26 conditions per place. [2025-01-09 21:29:49,521 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 19 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2025-01-09 21:29:49,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 814 flow [2025-01-09 21:29:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:29:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:29:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1905 transitions. [2025-01-09 21:29:49,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454094292803971 [2025-01-09 21:29:49,524 INFO L175 Difference]: Start difference. First operand has 338 places, 337 transitions, 756 flow. Second operand 5 states and 1905 transitions. [2025-01-09 21:29:49,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 814 flow [2025-01-09 21:29:49,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:49,529 INFO L231 Difference]: Finished difference. Result has 345 places, 341 transitions, 784 flow [2025-01-09 21:29:49,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=345, PETRI_TRANSITIONS=341} [2025-01-09 21:29:49,531 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -35 predicate places. [2025-01-09 21:29:49,531 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 341 transitions, 784 flow [2025-01-09 21:29:49,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 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:29:49,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:49,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:49,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:49,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 706968329, now seen corresponding path program 1 times [2025-01-09 21:29:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797693663] [2025-01-09 21:29:49,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:29:49,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:29:49,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,585 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:29:49,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797693663] [2025-01-09 21:29:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797693663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405866880] [2025-01-09 21:29:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2025-01-09 21:29:49,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 341 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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:29:49,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2025-01-09 21:29:49,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,811 INFO L124 PetriNetUnfolderBase]: 133/1059 cut-off events. [2025-01-09 21:29:49,811 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-09 21:29:49,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1059 events. 133/1059 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7257 event pairs, 20 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 1115. Up to 236 conditions per place. [2025-01-09 21:29:49,824 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 31 selfloop transitions, 9 changer transitions 10/338 dead transitions. [2025-01-09 21:29:49,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 338 transitions, 869 flow [2025-01-09 21:29:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-01-09 21:29:49,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91232423490488 [2025-01-09 21:29:49,826 INFO L175 Difference]: Start difference. First operand has 345 places, 341 transitions, 784 flow. Second operand 3 states and 1103 transitions. [2025-01-09 21:29:49,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 338 transitions, 869 flow [2025-01-09 21:29:49,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 338 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:49,833 INFO L231 Difference]: Finished difference. Result has 337 places, 321 transitions, 772 flow [2025-01-09 21:29:49,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=337, PETRI_TRANSITIONS=321} [2025-01-09 21:29:49,834 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -43 predicate places. [2025-01-09 21:29:49,834 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 321 transitions, 772 flow [2025-01-09 21:29:49,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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:29:49,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,835 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:29:49,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:49,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:49,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -999423788, now seen corresponding path program 1 times [2025-01-09 21:29:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064718678] [2025-01-09 21:29:49,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:49,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:49,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,898 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:29:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064718678] [2025-01-09 21:29:49,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064718678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539837328] [2025-01-09 21:29:49,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 403 [2025-01-09 21:29:49,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 321 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:29:49,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 403 [2025-01-09 21:29:49,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,007 INFO L124 PetriNetUnfolderBase]: 751/9298 cut-off events. [2025-01-09 21:29:51,007 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2025-01-09 21:29:51,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 9298 events. 751/9298 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 115323 event pairs, 349 based on Foata normal form. 0/8251 useless extension candidates. Maximal degree in co-relation 9115. Up to 1015 conditions per place. [2025-01-09 21:29:51,084 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/324 dead transitions. [2025-01-09 21:29:51,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 827 flow [2025-01-09 21:29:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-01-09 21:29:51,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-01-09 21:29:51,087 INFO L175 Difference]: Start difference. First operand has 337 places, 321 transitions, 772 flow. Second operand 3 states and 1152 transitions. [2025-01-09 21:29:51,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 827 flow [2025-01-09 21:29:51,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 324 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:51,099 INFO L231 Difference]: Finished difference. Result has 325 places, 321 transitions, 783 flow [2025-01-09 21:29:51,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2025-01-09 21:29:51,101 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2025-01-09 21:29:51,102 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 783 flow [2025-01-09 21:29:51,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:29:51,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:29:51,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:51,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash 601365272, now seen corresponding path program 1 times [2025-01-09 21:29:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017045132] [2025-01-09 21:29:51,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:29:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:29:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,162 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:29:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017045132] [2025-01-09 21:29:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017045132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491364157] [2025-01-09 21:29:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:51,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:51,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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:29:51,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:51,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:51,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,684 INFO L124 PetriNetUnfolderBase]: 284/2834 cut-off events. [2025-01-09 21:29:51,685 INFO L125 PetriNetUnfolderBase]: For 95/107 co-relation queries the response was YES. [2025-01-09 21:29:51,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 2834 events. 284/2834 cut-off events. For 95/107 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26461 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 2727. Up to 339 conditions per place. [2025-01-09 21:29:51,726 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-01-09 21:29:51,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 323 transitions, 850 flow [2025-01-09 21:29:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:51,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:51,729 INFO L175 Difference]: Start difference. First operand has 325 places, 321 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:51,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 323 transitions, 850 flow [2025-01-09 21:29:51,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 323 transitions, 850 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:51,735 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 785 flow [2025-01-09 21:29:51,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2025-01-09 21:29:51,736 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -54 predicate places. [2025-01-09 21:29:51,736 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 785 flow [2025-01-09 21:29:51,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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:29:51,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,737 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] [2025-01-09 21:29:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:51,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1288793370, now seen corresponding path program 1 times [2025-01-09 21:29:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741094529] [2025-01-09 21:29:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:29:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:29:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741094529] [2025-01-09 21:29:51,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741094529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288497544] [2025-01-09 21:29:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:51,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:51,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:29:51,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:51,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:51,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,460 INFO L124 PetriNetUnfolderBase]: 535/3683 cut-off events. [2025-01-09 21:29:52,460 INFO L125 PetriNetUnfolderBase]: For 379/387 co-relation queries the response was YES. [2025-01-09 21:29:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5758 conditions, 3683 events. 535/3683 cut-off events. For 379/387 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 36795 event pairs, 338 based on Foata normal form. 0/3346 useless extension candidates. Maximal degree in co-relation 5557. Up to 892 conditions per place. [2025-01-09 21:29:52,525 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-01-09 21:29:52,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 322 transitions, 850 flow [2025-01-09 21:29:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:52,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:52,528 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 785 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:52,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 322 transitions, 850 flow [2025-01-09 21:29:52,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 322 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:52,533 INFO L231 Difference]: Finished difference. Result has 325 places, 319 transitions, 783 flow [2025-01-09 21:29:52,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=319} [2025-01-09 21:29:52,534 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2025-01-09 21:29:52,534 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 319 transitions, 783 flow [2025-01-09 21:29:52,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:29:52,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:52,535 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] [2025-01-09 21:29:52,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:29:52,535 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:52,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -894912927, now seen corresponding path program 1 times [2025-01-09 21:29:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411201183] [2025-01-09 21:29:52,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:52,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:29:52,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:29:52,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:52,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411201183] [2025-01-09 21:29:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411201183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:52,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310984072] [2025-01-09 21:29:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:52,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:52,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:52,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:52,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:52,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 319 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 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:29:52,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:52,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:52,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:52,998 INFO L124 PetriNetUnfolderBase]: 284/2810 cut-off events. [2025-01-09 21:29:52,998 INFO L125 PetriNetUnfolderBase]: For 107/116 co-relation queries the response was YES. [2025-01-09 21:29:53,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 2810 events. 284/2810 cut-off events. For 107/116 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 26154 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3417. Up to 339 conditions per place. [2025-01-09 21:29:53,035 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-01-09 21:29:53,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 850 flow [2025-01-09 21:29:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:53,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:53,037 INFO L175 Difference]: Start difference. First operand has 325 places, 319 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:53,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 850 flow [2025-01-09 21:29:53,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 321 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:53,047 INFO L231 Difference]: Finished difference. Result has 324 places, 318 transitions, 781 flow [2025-01-09 21:29:53,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2025-01-09 21:29:53,051 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -56 predicate places. [2025-01-09 21:29:53,052 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 781 flow [2025-01-09 21:29:53,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 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:29:53,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,052 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] [2025-01-09 21:29:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:29:53,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2049375281, now seen corresponding path program 1 times [2025-01-09 21:29:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833139651] [2025-01-09 21:29:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:29:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:29:53,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,123 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:29:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833139651] [2025-01-09 21:29:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833139651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069500902] [2025-01-09 21:29:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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:29:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:53,679 INFO L124 PetriNetUnfolderBase]: 313/2791 cut-off events. [2025-01-09 21:29:53,680 INFO L125 PetriNetUnfolderBase]: For 249/252 co-relation queries the response was YES. [2025-01-09 21:29:53,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2791 events. 313/2791 cut-off events. For 249/252 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 25670 event pairs, 169 based on Foata normal form. 0/2533 useless extension candidates. Maximal degree in co-relation 3842. Up to 440 conditions per place. [2025-01-09 21:29:53,728 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2025-01-09 21:29:53,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 320 transitions, 850 flow [2025-01-09 21:29:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:53,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:53,731 INFO L175 Difference]: Start difference. First operand has 324 places, 318 transitions, 781 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:53,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 320 transitions, 850 flow [2025-01-09 21:29:53,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 320 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:53,736 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 779 flow [2025-01-09 21:29:53,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2025-01-09 21:29:53,737 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -57 predicate places. [2025-01-09 21:29:53,737 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 779 flow [2025-01-09 21:29:53,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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:29:53,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:53,738 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:29:53,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:29:53,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:53,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1152120689, now seen corresponding path program 1 times [2025-01-09 21:29:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:53,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128189908] [2025-01-09 21:29:53,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:53,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:29:53,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:29:53,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:53,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:53,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:29:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128189908] [2025-01-09 21:29:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128189908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422289175] [2025-01-09 21:29:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:53,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:53,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:53,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:29:53,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:53,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:53,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:54,294 INFO L124 PetriNetUnfolderBase]: 547/3767 cut-off events. [2025-01-09 21:29:54,294 INFO L125 PetriNetUnfolderBase]: For 384/390 co-relation queries the response was YES. [2025-01-09 21:29:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5892 conditions, 3767 events. 547/3767 cut-off events. For 384/390 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 37355 event pairs, 338 based on Foata normal form. 0/3465 useless extension candidates. Maximal degree in co-relation 5380. Up to 892 conditions per place. [2025-01-09 21:29:54,355 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-01-09 21:29:54,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 319 transitions, 844 flow [2025-01-09 21:29:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:54,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:54,357 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 779 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:54,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 319 transitions, 844 flow [2025-01-09 21:29:54,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 319 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:54,362 INFO L231 Difference]: Finished difference. Result has 322 places, 316 transitions, 777 flow [2025-01-09 21:29:54,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=322, PETRI_TRANSITIONS=316} [2025-01-09 21:29:54,363 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -58 predicate places. [2025-01-09 21:29:54,363 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 316 transitions, 777 flow [2025-01-09 21:29:54,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:29:54,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:54,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:54,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:29:54,364 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:54,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1773604949, now seen corresponding path program 1 times [2025-01-09 21:29:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781539096] [2025-01-09 21:29:54,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:54,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:29:54,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:29:54,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:54,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:54,400 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:29:54,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781539096] [2025-01-09 21:29:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781539096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:54,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:54,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919082130] [2025-01-09 21:29:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:54,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:54,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:54,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:54,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:54,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 316 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 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:29:54,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:54,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:54,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:54,727 INFO L124 PetriNetUnfolderBase]: 190/2157 cut-off events. [2025-01-09 21:29:54,728 INFO L125 PetriNetUnfolderBase]: For 185/192 co-relation queries the response was YES. [2025-01-09 21:29:54,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2157 events. 190/2157 cut-off events. For 185/192 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 18187 event pairs, 84 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 2379. Up to 254 conditions per place. [2025-01-09 21:29:54,752 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-01-09 21:29:54,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 318 transitions, 842 flow [2025-01-09 21:29:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:54,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:54,754 INFO L175 Difference]: Start difference. First operand has 322 places, 316 transitions, 777 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:54,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 318 transitions, 842 flow [2025-01-09 21:29:54,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 318 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:54,759 INFO L231 Difference]: Finished difference. Result has 321 places, 315 transitions, 775 flow [2025-01-09 21:29:54,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=321, PETRI_TRANSITIONS=315} [2025-01-09 21:29:54,760 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -59 predicate places. [2025-01-09 21:29:54,760 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 315 transitions, 775 flow [2025-01-09 21:29:54,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 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:29:54,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:54,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:54,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:29:54,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:54,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1342093124, now seen corresponding path program 1 times [2025-01-09 21:29:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794943846] [2025-01-09 21:29:54,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:54,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:29:54,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:29:54,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:54,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:54,793 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:29:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794943846] [2025-01-09 21:29:54,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794943846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:54,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:54,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417561333] [2025-01-09 21:29:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:54,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:54,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:54,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:54,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 315 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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:29:54,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:54,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:54,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:55,237 INFO L124 PetriNetUnfolderBase]: 284/2762 cut-off events. [2025-01-09 21:29:55,238 INFO L125 PetriNetUnfolderBase]: For 106/115 co-relation queries the response was YES. [2025-01-09 21:29:55,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2762 events. 284/2762 cut-off events. For 106/115 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 25507 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3436. Up to 339 conditions per place. [2025-01-09 21:29:55,279 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-01-09 21:29:55,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 842 flow [2025-01-09 21:29:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:55,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:55,281 INFO L175 Difference]: Start difference. First operand has 321 places, 315 transitions, 775 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:55,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 317 transitions, 842 flow [2025-01-09 21:29:55,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 317 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:55,287 INFO L231 Difference]: Finished difference. Result has 320 places, 314 transitions, 773 flow [2025-01-09 21:29:55,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=320, PETRI_TRANSITIONS=314} [2025-01-09 21:29:55,287 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -60 predicate places. [2025-01-09 21:29:55,287 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 314 transitions, 773 flow [2025-01-09 21:29:55,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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:29:55,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:55,288 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] [2025-01-09 21:29:55,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:29:55,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:55,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash -455555616, now seen corresponding path program 1 times [2025-01-09 21:29:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082834938] [2025-01-09 21:29:55,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:55,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:29:55,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:29:55,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:55,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:55,329 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:29:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082834938] [2025-01-09 21:29:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082834938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270159180] [2025-01-09 21:29:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:55,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:55,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:55,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:55,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:55,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:55,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 314 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:29:55,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:55,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:55,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:55,802 INFO L124 PetriNetUnfolderBase]: 313/2731 cut-off events. [2025-01-09 21:29:55,803 INFO L125 PetriNetUnfolderBase]: For 246/249 co-relation queries the response was YES. [2025-01-09 21:29:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 2731 events. 313/2731 cut-off events. For 246/249 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 24838 event pairs, 169 based on Foata normal form. 0/2521 useless extension candidates. Maximal degree in co-relation 3818. Up to 440 conditions per place. [2025-01-09 21:29:55,845 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2025-01-09 21:29:55,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 842 flow [2025-01-09 21:29:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:55,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:55,847 INFO L175 Difference]: Start difference. First operand has 320 places, 314 transitions, 773 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:55,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 842 flow [2025-01-09 21:29:55,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:55,853 INFO L231 Difference]: Finished difference. Result has 319 places, 313 transitions, 771 flow [2025-01-09 21:29:55,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=319, PETRI_TRANSITIONS=313} [2025-01-09 21:29:55,854 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -61 predicate places. [2025-01-09 21:29:55,854 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 313 transitions, 771 flow [2025-01-09 21:29:55,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:29:55,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:55,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:55,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:29:55,855 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:55,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1135926034, now seen corresponding path program 1 times [2025-01-09 21:29:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637734834] [2025-01-09 21:29:55,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:55,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:29:55,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:29:55,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:55,897 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:29:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:55,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637734834] [2025-01-09 21:29:55,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637734834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:55,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:55,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028522141] [2025-01-09 21:29:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:55,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:55,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:56,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:56,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 313 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:56,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:56,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:56,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:56,510 INFO L124 PetriNetUnfolderBase]: 559/3834 cut-off events. [2025-01-09 21:29:56,510 INFO L125 PetriNetUnfolderBase]: For 384/390 co-relation queries the response was YES. [2025-01-09 21:29:56,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 3834 events. 559/3834 cut-off events. For 384/390 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37455 event pairs, 338 based on Foata normal form. 0/3582 useless extension candidates. Maximal degree in co-relation 5597. Up to 892 conditions per place. [2025-01-09 21:29:56,561 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-01-09 21:29:56,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 836 flow [2025-01-09 21:29:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:56,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:56,563 INFO L175 Difference]: Start difference. First operand has 319 places, 313 transitions, 771 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:56,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 836 flow [2025-01-09 21:29:56,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 315 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:56,568 INFO L231 Difference]: Finished difference. Result has 318 places, 312 transitions, 769 flow [2025-01-09 21:29:56,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=318, PETRI_TRANSITIONS=312} [2025-01-09 21:29:56,569 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -62 predicate places. [2025-01-09 21:29:56,569 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 312 transitions, 769 flow [2025-01-09 21:29:56,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:56,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:56,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:56,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:29:56,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1996881016, now seen corresponding path program 1 times [2025-01-09 21:29:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:56,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643351839] [2025-01-09 21:29:56,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:56,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:29:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:29:56,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:56,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643351839] [2025-01-09 21:29:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643351839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:56,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:56,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:56,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92100338] [2025-01-09 21:29:56,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:56,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:56,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:56,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:56,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:56,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:56,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 312 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 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:29:56,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:56,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:56,891 INFO L124 PetriNetUnfolderBase]: 190/2134 cut-off events. [2025-01-09 21:29:56,891 INFO L125 PetriNetUnfolderBase]: For 185/189 co-relation queries the response was YES. [2025-01-09 21:29:56,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 2134 events. 190/2134 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17839 event pairs, 84 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 2560. Up to 254 conditions per place. [2025-01-09 21:29:56,917 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2025-01-09 21:29:56,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 834 flow [2025-01-09 21:29:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:56,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:56,920 INFO L175 Difference]: Start difference. First operand has 318 places, 312 transitions, 769 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:56,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 834 flow [2025-01-09 21:29:56,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:56,924 INFO L231 Difference]: Finished difference. Result has 317 places, 311 transitions, 767 flow [2025-01-09 21:29:56,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=317, PETRI_TRANSITIONS=311} [2025-01-09 21:29:56,925 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -63 predicate places. [2025-01-09 21:29:56,926 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 311 transitions, 767 flow [2025-01-09 21:29:56,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 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:29:56,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:56,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:56,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:29:56,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:56,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1782513613, now seen corresponding path program 1 times [2025-01-09 21:29:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:56,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745490844] [2025-01-09 21:29:56,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:56,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:29:56,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:29:56,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:56,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:56,954 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:29:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745490844] [2025-01-09 21:29:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745490844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264372539] [2025-01-09 21:29:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:56,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:57,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:57,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 311 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:29:57,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:57,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:57,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:57,286 INFO L124 PetriNetUnfolderBase]: 284/2714 cut-off events. [2025-01-09 21:29:57,286 INFO L125 PetriNetUnfolderBase]: For 106/115 co-relation queries the response was YES. [2025-01-09 21:29:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3919 conditions, 2714 events. 284/2714 cut-off events. For 106/115 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 24790 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3520. Up to 339 conditions per place. [2025-01-09 21:29:57,320 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-01-09 21:29:57,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 834 flow [2025-01-09 21:29:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:57,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:57,322 INFO L175 Difference]: Start difference. First operand has 317 places, 311 transitions, 767 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:57,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 834 flow [2025-01-09 21:29:57,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 313 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:57,327 INFO L231 Difference]: Finished difference. Result has 316 places, 310 transitions, 765 flow [2025-01-09 21:29:57,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=316, PETRI_TRANSITIONS=310} [2025-01-09 21:29:57,328 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -64 predicate places. [2025-01-09 21:29:57,328 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 310 transitions, 765 flow [2025-01-09 21:29:57,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:29:57,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:57,328 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] [2025-01-09 21:29:57,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:29:57,329 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:57,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash -83596515, now seen corresponding path program 1 times [2025-01-09 21:29:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:57,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802620250] [2025-01-09 21:29:57,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:57,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:29:57,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:29:57,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:57,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:57,352 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:29:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802620250] [2025-01-09 21:29:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802620250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:57,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:57,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951123039] [2025-01-09 21:29:57,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:57,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:57,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:57,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:57,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 310 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:29:57,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:57,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:57,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:57,734 INFO L124 PetriNetUnfolderBase]: 313/2671 cut-off events. [2025-01-09 21:29:57,734 INFO L125 PetriNetUnfolderBase]: For 243/246 co-relation queries the response was YES. [2025-01-09 21:29:57,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 2671 events. 313/2671 cut-off events. For 243/246 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23928 event pairs, 169 based on Foata normal form. 0/2509 useless extension candidates. Maximal degree in co-relation 3794. Up to 440 conditions per place. [2025-01-09 21:29:57,764 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2025-01-09 21:29:57,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 312 transitions, 834 flow [2025-01-09 21:29:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:57,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:57,766 INFO L175 Difference]: Start difference. First operand has 316 places, 310 transitions, 765 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:57,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 312 transitions, 834 flow [2025-01-09 21:29:57,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 312 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:57,771 INFO L231 Difference]: Finished difference. Result has 315 places, 309 transitions, 763 flow [2025-01-09 21:29:57,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=315, PETRI_TRANSITIONS=309} [2025-01-09 21:29:57,772 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -65 predicate places. [2025-01-09 21:29:57,772 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 309 transitions, 763 flow [2025-01-09 21:29:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:29:57,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:57,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:29:57,772 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:57,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -915659269, now seen corresponding path program 1 times [2025-01-09 21:29:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100943913] [2025-01-09 21:29:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:57,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:29:57,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:29:57,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:57,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:57,806 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:29:57,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:57,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100943913] [2025-01-09 21:29:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100943913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:57,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906887424] [2025-01-09 21:29:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:57,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:57,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:57,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:57,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:57,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 309 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:29:57,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:57,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:57,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,345 INFO L124 PetriNetUnfolderBase]: 571/3895 cut-off events. [2025-01-09 21:29:58,345 INFO L125 PetriNetUnfolderBase]: For 384/390 co-relation queries the response was YES. [2025-01-09 21:29:58,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6092 conditions, 3895 events. 571/3895 cut-off events. For 384/390 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 37579 event pairs, 338 based on Foata normal form. 0/3703 useless extension candidates. Maximal degree in co-relation 5808. Up to 892 conditions per place. [2025-01-09 21:29:58,413 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-01-09 21:29:58,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 311 transitions, 828 flow [2025-01-09 21:29:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:58,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:58,415 INFO L175 Difference]: Start difference. First operand has 315 places, 309 transitions, 763 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:58,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 311 transitions, 828 flow [2025-01-09 21:29:58,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 311 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:58,420 INFO L231 Difference]: Finished difference. Result has 314 places, 308 transitions, 761 flow [2025-01-09 21:29:58,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=314, PETRI_TRANSITIONS=308} [2025-01-09 21:29:58,422 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -66 predicate places. [2025-01-09 21:29:58,422 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 308 transitions, 761 flow [2025-01-09 21:29:58,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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:29:58,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:58,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:29:58,423 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:58,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -41811519, now seen corresponding path program 1 times [2025-01-09 21:29:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287115113] [2025-01-09 21:29:58,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:29:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:29:58,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,455 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:29:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287115113] [2025-01-09 21:29:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287115113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375921795] [2025-01-09 21:29:58,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:58,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 308 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:29:58,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:58,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,725 INFO L124 PetriNetUnfolderBase]: 190/2090 cut-off events. [2025-01-09 21:29:58,725 INFO L125 PetriNetUnfolderBase]: For 184/188 co-relation queries the response was YES. [2025-01-09 21:29:58,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 2090 events. 190/2090 cut-off events. For 184/188 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17331 event pairs, 84 based on Foata normal form. 0/1983 useless extension candidates. Maximal degree in co-relation 2720. Up to 254 conditions per place. [2025-01-09 21:29:58,749 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-01-09 21:29:58,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 310 transitions, 826 flow [2025-01-09 21:29:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:58,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:58,751 INFO L175 Difference]: Start difference. First operand has 314 places, 308 transitions, 761 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:58,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 310 transitions, 826 flow [2025-01-09 21:29:58,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 310 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:58,755 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 759 flow [2025-01-09 21:29:58,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2025-01-09 21:29:58,756 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -67 predicate places. [2025-01-09 21:29:58,756 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 759 flow [2025-01-09 21:29:58,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:29:58,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,756 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] [2025-01-09 21:29:58,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:29:58,756 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:58,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1839639412, now seen corresponding path program 1 times [2025-01-09 21:29:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359961285] [2025-01-09 21:29:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:29:58,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:29:58,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,790 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:29:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359961285] [2025-01-09 21:29:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359961285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453179466] [2025-01-09 21:29:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-01-09 21:29:58,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:58,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-01-09 21:29:58,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:59,106 INFO L124 PetriNetUnfolderBase]: 313/2614 cut-off events. [2025-01-09 21:29:59,106 INFO L125 PetriNetUnfolderBase]: For 245/248 co-relation queries the response was YES. [2025-01-09 21:29:59,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 2614 events. 313/2614 cut-off events. For 245/248 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 23192 event pairs, 169 based on Foata normal form. 0/2497 useless extension candidates. Maximal degree in co-relation 3616. Up to 440 conditions per place. [2025-01-09 21:29:59,137 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-01-09 21:29:59,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 828 flow [2025-01-09 21:29:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-01-09 21:29:59,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-01-09 21:29:59,139 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 759 flow. Second operand 3 states and 1131 transitions. [2025-01-09 21:29:59,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 828 flow [2025-01-09 21:29:59,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 309 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:59,143 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 757 flow [2025-01-09 21:29:59,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-01-09 21:29:59,144 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -68 predicate places. [2025-01-09 21:29:59,144 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 757 flow [2025-01-09 21:29:59,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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:29:59,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:59,144 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] [2025-01-09 21:29:59,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:29:59,144 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-01-09 21:29:59,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2086918308, now seen corresponding path program 1 times [2025-01-09 21:29:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189156234] [2025-01-09 21:29:59,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:59,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:29:59,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:29:59,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:59,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:59,166 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:29:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189156234] [2025-01-09 21:29:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189156234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:59,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186007284] [2025-01-09 21:29:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:59,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:59,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-01-09 21:29:59,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 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:29:59,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-01-09 21:29:59,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:59,429 INFO L124 PetriNetUnfolderBase]: 190/2066 cut-off events. [2025-01-09 21:29:59,429 INFO L125 PetriNetUnfolderBase]: For 175/179 co-relation queries the response was YES. [2025-01-09 21:29:59,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 2066 events. 190/2066 cut-off events. For 175/179 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17080 event pairs, 84 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 2769. Up to 254 conditions per place. [2025-01-09 21:29:59,453 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 0 selfloop transitions, 0 changer transitions 308/308 dead transitions. [2025-01-09 21:29:59,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 822 flow [2025-01-09 21:29:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-01-09 21:29:59,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-01-09 21:29:59,455 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 757 flow. Second operand 3 states and 1133 transitions. [2025-01-09 21:29:59,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 822 flow [2025-01-09 21:29:59,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 308 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:59,458 INFO L231 Difference]: Finished difference. Result has 311 places, 0 transitions, 0 flow [2025-01-09 21:29:59,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=311, PETRI_TRANSITIONS=0} [2025-01-09 21:29:59,459 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -69 predicate places. [2025-01-09 21:29:59,459 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 0 transitions, 0 flow [2025-01-09 21:29:59,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 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:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (130 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (129 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (128 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (127 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (126 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (124 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (123 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (122 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (121 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (120 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (119 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (118 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (117 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (116 of 131 remaining) [2025-01-09 21:29:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (115 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (114 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (113 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (112 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (111 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (110 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (109 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (108 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (107 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (106 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (105 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (104 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (103 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (102 of 131 remaining) [2025-01-09 21:29:59,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (101 of 131 remaining) [2025-01-09 21:29:59,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (100 of 131 remaining) [2025-01-09 21:29:59,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (99 of 131 remaining) [2025-01-09 21:29:59,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (98 of 131 remaining) [2025-01-09 21:29:59,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (97 of 131 remaining) [2025-01-09 21:29:59,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (96 of 131 remaining) [2025-01-09 21:29:59,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (95 of 131 remaining) [2025-01-09 21:29:59,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (94 of 131 remaining) [2025-01-09 21:29:59,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (93 of 131 remaining) [2025-01-09 21:29:59,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (92 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (91 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (89 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (86 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (84 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (82 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (80 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (79 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (78 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (77 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (76 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (69 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (68 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (67 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (66 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (65 of 131 remaining) [2025-01-09 21:29:59,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (64 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (63 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (62 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (61 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (60 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (59 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (58 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (57 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (56 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (52 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (46 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (43 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (42 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (41 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (39 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (36 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 131 remaining) [2025-01-09 21:29:59,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (33 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (32 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (31 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (30 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (29 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (28 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (27 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (26 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (24 of 131 remaining) [2025-01-09 21:29:59,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (23 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (22 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (21 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (20 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (19 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (18 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (17 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (16 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (15 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (14 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (13 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (12 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (11 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (10 of 131 remaining) [2025-01-09 21:29:59,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (9 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (8 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (7 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (6 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (5 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (4 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (2 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (1 of 131 remaining) [2025-01-09 21:29:59,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (0 of 131 remaining) [2025-01-09 21:29:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:29:59,477 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:59,481 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:29:59,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:29:59,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:29:59 BasicIcfg [2025-01-09 21:29:59,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:29:59,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:29:59,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:29:59,488 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:29:59,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:47" (3/4) ... [2025-01-09 21:29:59,489 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:29:59,491 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:29:59,491 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:29:59,491 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:29:59,492 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:29:59,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:29:59,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:29:59,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:29:59,496 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:29:59,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:29:59,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:29:59,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:29:59,560 INFO L158 Benchmark]: Toolchain (without parser) took 13321.83ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 107.3MB in the beginning and 732.2MB in the end (delta: -624.9MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. [2025-01-09 21:29:59,560 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:29:59,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.76ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 94.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:59,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.40ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:29:59,562 INFO L158 Benchmark]: Boogie Preprocessor took 35.85ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:59,562 INFO L158 Benchmark]: RCFGBuilder took 521.36ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 65.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:29:59,563 INFO L158 Benchmark]: TraceAbstraction took 12460.88ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 65.3MB in the beginning and 736.6MB in the end (delta: -671.4MB). Peak memory consumption was 337.9MB. Max. memory is 16.1GB. [2025-01-09 21:29:59,563 INFO L158 Benchmark]: Witness Printer took 71.56ms. Allocated memory is still 1.2GB. Free memory was 736.6MB in the beginning and 732.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:59,564 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.36ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.76ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 94.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.40ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.85ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 521.36ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 65.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12460.88ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 65.3MB in the beginning and 736.6MB in the end (delta: -671.4MB). Peak memory consumption was 337.9MB. Max. memory is 16.1GB. * Witness Printer took 71.56ms. Allocated memory is still 1.2GB. Free memory was 736.6MB in the beginning and 732.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 630 locations, 131 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2566 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 544 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2581 IncrementalHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 536 mSDtfsCounter, 2581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=12, InterpolantAutomatonStates: 83, 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, 2347 NumberOfCodeBlocks, 2347 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 2374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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:29:59,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE