./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:28,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:28,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:28,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:28,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:28,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:28,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:28,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:28,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:28,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:28,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:28,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:28,331 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:28,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:28,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:28,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:28,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:28,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:28,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:28,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:28,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:28,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:28,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:28,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:28,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:28,334 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 -> 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f [2025-01-09 21:32:28,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:28,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:28,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:28,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:28,559 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:28,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-01-09 21:32:29,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b114f6cab/fee2be91c6ea4fa59d90716d9f61a7cf/FLAG1117b8592 [2025-01-09 21:32:29,902 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:29,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2025-01-09 21:32:29,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b114f6cab/fee2be91c6ea4fa59d90716d9f61a7cf/FLAG1117b8592 [2025-01-09 21:32:29,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b114f6cab/fee2be91c6ea4fa59d90716d9f61a7cf [2025-01-09 21:32:29,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:29,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:29,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:29,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:29,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:29,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:29" (1/1) ... [2025-01-09 21:32:29,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1781c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:29, skipping insertion in model container [2025-01-09 21:32:29,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:29" (1/1) ... [2025-01-09 21:32:29,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:30,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:30,093 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:30,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:30,132 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:30,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30 WrapperNode [2025-01-09 21:32:30,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:30,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:30,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:30,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:30,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,161 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 256 [2025-01-09 21:32:30,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:30,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:30,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:30,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:30,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:30,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:30,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:30,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:30,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (1/1) ... [2025-01-09 21:32:30,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:30,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:32:30,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-09 21:32:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-09 21:32:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:30,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:30,239 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:30,322 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:30,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:30,574 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:30,574 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:30,604 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:30,604 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:32:30,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:30 BoogieIcfgContainer [2025-01-09 21:32:30,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:30,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:30,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:30,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:30,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:29" (1/3) ... [2025-01-09 21:32:30,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37de6068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:30, skipping insertion in model container [2025-01-09 21:32:30,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:30" (2/3) ... [2025-01-09 21:32:30,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37de6068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:30, skipping insertion in model container [2025-01-09 21:32:30,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:30" (3/3) ... [2025-01-09 21:32:30,613 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2025-01-09 21:32:30,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:30,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 271 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-01-09 21:32:30,628 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:30,716 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-09 21:32:30,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 281 transitions, 597 flow [2025-01-09 21:32:30,849 INFO L124 PetriNetUnfolderBase]: 11/276 cut-off events. [2025-01-09 21:32:30,852 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:32:30,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 276 events. 11/276 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. [2025-01-09 21:32:30,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 281 transitions, 597 flow [2025-01-09 21:32:30,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 259 transitions, 545 flow [2025-01-09 21:32:30,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:30,887 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;@7e79c7a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:30,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 21:32:30,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:30,897 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-09 21:32:30,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:30,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:30,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:30,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 285471371, now seen corresponding path program 1 times [2025-01-09 21:32:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010722212] [2025-01-09 21:32:30,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:32:30,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:32:30,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:30,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010722212] [2025-01-09 21:32:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010722212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86374545] [2025-01-09 21:32:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 281 [2025-01-09 21:32:31,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:31,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 281 [2025-01-09 21:32:31,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,638 INFO L124 PetriNetUnfolderBase]: 2112/10432 cut-off events. [2025-01-09 21:32:32,638 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-01-09 21:32:32,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13475 conditions, 10432 events. 2112/10432 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 119043 event pairs, 1784 based on Foata normal form. 767/9569 useless extension candidates. Maximal degree in co-relation 12989. Up to 2513 conditions per place. [2025-01-09 21:32:32,744 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 24 selfloop transitions, 2 changer transitions 1/252 dead transitions. [2025-01-09 21:32:32,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 583 flow [2025-01-09 21:32:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-01-09 21:32:32,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074733096085409 [2025-01-09 21:32:32,761 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 545 flow. Second operand 3 states and 765 transitions. [2025-01-09 21:32:32,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 583 flow [2025-01-09 21:32:32,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 252 transitions, 566 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-09 21:32:32,771 INFO L231 Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow [2025-01-09 21:32:32,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2025-01-09 21:32:32,777 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -8 predicate places. [2025-01-09 21:32:32,777 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow [2025-01-09 21:32:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:32,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:32,778 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:32:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:32,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:32,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:32,780 INFO L85 PathProgramCache]: Analyzing trace with hash -987359909, now seen corresponding path program 1 times [2025-01-09 21:32:32,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:32,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948085272] [2025-01-09 21:32:32,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:32,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:32:32,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:32:32,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:32,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948085272] [2025-01-09 21:32:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948085272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778858055] [2025-01-09 21:32:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:32,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:32,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:32,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:32,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 281 [2025-01-09 21:32:32,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:32,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:32,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 281 [2025-01-09 21:32:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:33,976 INFO L124 PetriNetUnfolderBase]: 2278/10788 cut-off events. [2025-01-09 21:32:33,977 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-01-09 21:32:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13853 conditions, 10788 events. 2278/10788 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 123142 event pairs, 1944 based on Foata normal form. 0/9091 useless extension candidates. Maximal degree in co-relation 13817. Up to 2725 conditions per place. [2025-01-09 21:32:34,065 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 24 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-01-09 21:32:34,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 566 flow [2025-01-09 21:32:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:32:34,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900355871886121 [2025-01-09 21:32:34,069 INFO L175 Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:32:34,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 566 flow [2025-01-09 21:32:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 250 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:34,076 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 514 flow [2025-01-09 21:32:34,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2025-01-09 21:32:34,077 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -10 predicate places. [2025-01-09 21:32:34,077 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 514 flow [2025-01-09 21:32:34,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:34,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:34,078 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] [2025-01-09 21:32:34,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:34,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:34,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1592282044, now seen corresponding path program 1 times [2025-01-09 21:32:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:34,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454406529] [2025-01-09 21:32:34,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:32:34,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:32:34,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:34,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:34,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454406529] [2025-01-09 21:32:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454406529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176662428] [2025-01-09 21:32:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:34,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:34,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:34,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 281 [2025-01-09 21:32:34,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:34,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:34,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 281 [2025-01-09 21:32:34,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:35,061 INFO L124 PetriNetUnfolderBase]: 2280/10069 cut-off events. [2025-01-09 21:32:35,061 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2025-01-09 21:32:35,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13172 conditions, 10069 events. 2280/10069 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 111361 event pairs, 1976 based on Foata normal form. 0/8453 useless extension candidates. Maximal degree in co-relation 13128. Up to 2769 conditions per place. [2025-01-09 21:32:35,137 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 24 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-01-09 21:32:35,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 249 transitions, 564 flow [2025-01-09 21:32:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:32:35,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900355871886121 [2025-01-09 21:32:35,140 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 514 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:32:35,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 249 transitions, 564 flow [2025-01-09 21:32:35,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:35,144 INFO L231 Difference]: Finished difference. Result has 254 places, 249 transitions, 512 flow [2025-01-09 21:32:35,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=254, PETRI_TRANSITIONS=249} [2025-01-09 21:32:35,145 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -11 predicate places. [2025-01-09 21:32:35,145 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 512 flow [2025-01-09 21:32:35,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:35,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:35,146 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] [2025-01-09 21:32:35,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:35,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1841425130, now seen corresponding path program 1 times [2025-01-09 21:32:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700268087] [2025-01-09 21:32:35,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:35,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:32:35,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:32:35,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:35,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700268087] [2025-01-09 21:32:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700268087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:35,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119620719] [2025-01-09 21:32:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:35,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:35,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:35,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:35,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 281 [2025-01-09 21:32:35,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:35,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:35,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 281 [2025-01-09 21:32:35,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:36,000 INFO L124 PetriNetUnfolderBase]: 2188/8536 cut-off events. [2025-01-09 21:32:36,000 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-01-09 21:32:36,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11577 conditions, 8536 events. 2188/8536 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 89139 event pairs, 1944 based on Foata normal form. 0/7148 useless extension candidates. Maximal degree in co-relation 11525. Up to 2725 conditions per place. [2025-01-09 21:32:36,057 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 24 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2025-01-09 21:32:36,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 562 flow [2025-01-09 21:32:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:32:36,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900355871886121 [2025-01-09 21:32:36,059 INFO L175 Difference]: Start difference. First operand has 254 places, 249 transitions, 512 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:32:36,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 562 flow [2025-01-09 21:32:36,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:36,062 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 510 flow [2025-01-09 21:32:36,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2025-01-09 21:32:36,063 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -12 predicate places. [2025-01-09 21:32:36,063 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 510 flow [2025-01-09 21:32:36,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:36,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:36,064 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] [2025-01-09 21:32:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:36,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 749159949, now seen corresponding path program 1 times [2025-01-09 21:32:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704078714] [2025-01-09 21:32:36,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:36,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:32:36,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:32:36,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:36,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704078714] [2025-01-09 21:32:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704078714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767326825] [2025-01-09 21:32:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:36,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:36,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:36,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 281 [2025-01-09 21:32:36,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:36,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:36,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 281 [2025-01-09 21:32:36,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:37,220 INFO L124 PetriNetUnfolderBase]: 2118/10633 cut-off events. [2025-01-09 21:32:37,220 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-01-09 21:32:37,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13354 conditions, 10633 events. 2118/10633 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 119986 event pairs, 1784 based on Foata normal form. 0/8987 useless extension candidates. Maximal degree in co-relation 13294. Up to 2513 conditions per place. [2025-01-09 21:32:37,307 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 24 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-01-09 21:32:37,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 560 flow [2025-01-09 21:32:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-01-09 21:32:37,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900355871886121 [2025-01-09 21:32:37,310 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 510 flow. Second operand 3 states and 759 transitions. [2025-01-09 21:32:37,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 247 transitions, 560 flow [2025-01-09 21:32:37,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:37,313 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 508 flow [2025-01-09 21:32:37,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2025-01-09 21:32:37,314 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -13 predicate places. [2025-01-09 21:32:37,314 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 508 flow [2025-01-09 21:32:37,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:37,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:37,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:37,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:37,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:37,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:37,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1388484959, now seen corresponding path program 1 times [2025-01-09 21:32:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786375868] [2025-01-09 21:32:37,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:37,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:32:37,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:32:37,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:37,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786375868] [2025-01-09 21:32:37,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786375868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:37,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:37,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595590794] [2025-01-09 21:32:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:37,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:37,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:37,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:37,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 281 [2025-01-09 21:32:37,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:37,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:37,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 281 [2025-01-09 21:32:37,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:38,450 INFO L124 PetriNetUnfolderBase]: 3102/12484 cut-off events. [2025-01-09 21:32:38,450 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-01-09 21:32:38,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16871 conditions, 12484 events. 3102/12484 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 144281 event pairs, 2108 based on Foata normal form. 0/10599 useless extension candidates. Maximal degree in co-relation 16803. Up to 2956 conditions per place. [2025-01-09 21:32:38,528 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 35 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2025-01-09 21:32:38,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 258 transitions, 609 flow [2025-01-09 21:32:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-01-09 21:32:38,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9205219454329775 [2025-01-09 21:32:38,530 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 508 flow. Second operand 3 states and 776 transitions. [2025-01-09 21:32:38,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 258 transitions, 609 flow [2025-01-09 21:32:38,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 258 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:38,533 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 506 flow [2025-01-09 21:32:38,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2025-01-09 21:32:38,533 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -14 predicate places. [2025-01-09 21:32:38,533 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 506 flow [2025-01-09 21:32:38,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:38,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:38,534 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:32:38,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:38,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1807943198, now seen corresponding path program 1 times [2025-01-09 21:32:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:38,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97445194] [2025-01-09 21:32:38,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:38,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:32:38,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:32:38,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:38,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97445194] [2025-01-09 21:32:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97445194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:38,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291985777] [2025-01-09 21:32:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:38,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:38,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:38,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:38,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 281 [2025-01-09 21:32:38,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:38,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:38,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 281 [2025-01-09 21:32:38,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:39,337 INFO L124 PetriNetUnfolderBase]: 2274/8550 cut-off events. [2025-01-09 21:32:39,338 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-01-09 21:32:39,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12045 conditions, 8550 events. 2274/8550 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 90771 event pairs, 1330 based on Foata normal form. 0/7568 useless extension candidates. Maximal degree in co-relation 8122. Up to 1739 conditions per place. [2025-01-09 21:32:39,396 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 34 selfloop transitions, 1 changer transitions 0/257 dead transitions. [2025-01-09 21:32:39,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 257 transitions, 603 flow [2025-01-09 21:32:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-01-09 21:32:39,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252669039145908 [2025-01-09 21:32:39,398 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 506 flow. Second operand 3 states and 780 transitions. [2025-01-09 21:32:39,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 257 transitions, 603 flow [2025-01-09 21:32:39,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 257 transitions, 599 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:39,401 INFO L231 Difference]: Finished difference. Result has 250 places, 245 transitions, 502 flow [2025-01-09 21:32:39,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=250, PETRI_TRANSITIONS=245} [2025-01-09 21:32:39,403 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-01-09 21:32:39,404 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 502 flow [2025-01-09 21:32:39,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:39,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:39,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:39,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:39,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1924736647, now seen corresponding path program 1 times [2025-01-09 21:32:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042817810] [2025-01-09 21:32:39,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:39,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:32:39,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:32:39,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:39,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042817810] [2025-01-09 21:32:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042817810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:39,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924504371] [2025-01-09 21:32:39,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:39,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:39,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:39,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:39,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 281 [2025-01-09 21:32:39,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:39,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:39,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 281 [2025-01-09 21:32:39,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:40,539 INFO L124 PetriNetUnfolderBase]: 3543/13227 cut-off events. [2025-01-09 21:32:40,539 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-01-09 21:32:40,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18150 conditions, 13227 events. 3543/13227 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 150937 event pairs, 2348 based on Foata normal form. 0/11238 useless extension candidates. Maximal degree in co-relation 13510. Up to 3274 conditions per place. [2025-01-09 21:32:40,609 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 35 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2025-01-09 21:32:40,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 256 transitions, 603 flow [2025-01-09 21:32:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-01-09 21:32:40,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9205219454329775 [2025-01-09 21:32:40,611 INFO L175 Difference]: Start difference. First operand has 250 places, 245 transitions, 502 flow. Second operand 3 states and 776 transitions. [2025-01-09 21:32:40,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 256 transitions, 603 flow [2025-01-09 21:32:40,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:40,613 INFO L231 Difference]: Finished difference. Result has 250 places, 244 transitions, 503 flow [2025-01-09 21:32:40,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=250, PETRI_TRANSITIONS=244} [2025-01-09 21:32:40,614 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places. [2025-01-09 21:32:40,614 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 503 flow [2025-01-09 21:32:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:40,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:40,615 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:32:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:40,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1905989238, now seen corresponding path program 1 times [2025-01-09 21:32:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280681606] [2025-01-09 21:32:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:32:40,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:32:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280681606] [2025-01-09 21:32:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280681606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:40,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783235494] [2025-01-09 21:32:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:40,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:40,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:40,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:40,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 281 [2025-01-09 21:32:40,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:40,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:40,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 281 [2025-01-09 21:32:40,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:41,878 INFO L124 PetriNetUnfolderBase]: 2627/9738 cut-off events. [2025-01-09 21:32:41,878 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2025-01-09 21:32:41,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13605 conditions, 9738 events. 2627/9738 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 105001 event pairs, 1395 based on Foata normal form. 0/8491 useless extension candidates. Maximal degree in co-relation 9859. Up to 1760 conditions per place. [2025-01-09 21:32:41,948 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 34 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-01-09 21:32:41,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 255 transitions, 600 flow [2025-01-09 21:32:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-01-09 21:32:41,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252669039145908 [2025-01-09 21:32:41,950 INFO L175 Difference]: Start difference. First operand has 250 places, 244 transitions, 503 flow. Second operand 3 states and 780 transitions. [2025-01-09 21:32:41,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 255 transitions, 600 flow [2025-01-09 21:32:41,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 255 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:41,964 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 499 flow [2025-01-09 21:32:41,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-01-09 21:32:41,965 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-01-09 21:32:41,965 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 499 flow [2025-01-09 21:32:41,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:41,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:41,966 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] [2025-01-09 21:32:41,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:41,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:41,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash -578652627, now seen corresponding path program 1 times [2025-01-09 21:32:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:41,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864819930] [2025-01-09 21:32:41,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:41,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:32:42,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:32:42,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:42,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:42,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864819930] [2025-01-09 21:32:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864819930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873400932] [2025-01-09 21:32:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:42,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:42,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 281 [2025-01-09 21:32:42,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:42,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:42,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 281 [2025-01-09 21:32:42,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,053 INFO L124 PetriNetUnfolderBase]: 3578/11658 cut-off events. [2025-01-09 21:32:43,053 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-01-09 21:32:43,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16707 conditions, 11658 events. 3578/11658 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 124842 event pairs, 2396 based on Foata normal form. 0/9928 useless extension candidates. Maximal degree in co-relation 12634. Up to 3340 conditions per place. [2025-01-09 21:32:43,131 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 35 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-01-09 21:32:43,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 600 flow [2025-01-09 21:32:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-01-09 21:32:43,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9205219454329775 [2025-01-09 21:32:43,133 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 499 flow. Second operand 3 states and 776 transitions. [2025-01-09 21:32:43,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 600 flow [2025-01-09 21:32:43,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 254 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:43,136 INFO L231 Difference]: Finished difference. Result has 249 places, 242 transitions, 500 flow [2025-01-09 21:32:43,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=242} [2025-01-09 21:32:43,136 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places. [2025-01-09 21:32:43,136 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 500 flow [2025-01-09 21:32:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,137 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:32:43,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:43,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:43,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -820075280, now seen corresponding path program 1 times [2025-01-09 21:32:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469520735] [2025-01-09 21:32:43,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:32:43,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:32:43,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,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:32:43,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469520735] [2025-01-09 21:32:43,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469520735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027981093] [2025-01-09 21:32:43,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 281 [2025-01-09 21:32:43,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:43,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 281 [2025-01-09 21:32:43,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,101 INFO L124 PetriNetUnfolderBase]: 2699/9424 cut-off events. [2025-01-09 21:32:44,102 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-01-09 21:32:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13421 conditions, 9424 events. 2699/9424 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 98595 event pairs, 1122 based on Foata normal form. 0/8139 useless extension candidates. Maximal degree in co-relation 9958. Up to 1745 conditions per place. [2025-01-09 21:32:44,176 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 34 selfloop transitions, 1 changer transitions 0/253 dead transitions. [2025-01-09 21:32:44,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 253 transitions, 597 flow [2025-01-09 21:32:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-01-09 21:32:44,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252669039145908 [2025-01-09 21:32:44,178 INFO L175 Difference]: Start difference. First operand has 249 places, 242 transitions, 500 flow. Second operand 3 states and 780 transitions. [2025-01-09 21:32:44,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 253 transitions, 597 flow [2025-01-09 21:32:44,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 253 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:44,183 INFO L231 Difference]: Finished difference. Result has 248 places, 241 transitions, 496 flow [2025-01-09 21:32:44,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=248, PETRI_TRANSITIONS=241} [2025-01-09 21:32:44,184 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-01-09 21:32:44,184 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 241 transitions, 496 flow [2025-01-09 21:32:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:44,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:44,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:44,185 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:44,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -264887605, now seen corresponding path program 1 times [2025-01-09 21:32:44,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568479254] [2025-01-09 21:32:44,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:32:44,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:32:44,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:44,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568479254] [2025-01-09 21:32:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568479254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:44,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:44,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:44,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979034838] [2025-01-09 21:32:44,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:44,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:44,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:44,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:44,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 281 [2025-01-09 21:32:44,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 241 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:44,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:44,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 281 [2025-01-09 21:32:44,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:45,035 INFO L124 PetriNetUnfolderBase]: 3402/9302 cut-off events. [2025-01-09 21:32:45,036 INFO L125 PetriNetUnfolderBase]: For 315/315 co-relation queries the response was YES. [2025-01-09 21:32:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14263 conditions, 9302 events. 3402/9302 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 89924 event pairs, 2348 based on Foata normal form. 0/8037 useless extension candidates. Maximal degree in co-relation 10113. Up to 3274 conditions per place. [2025-01-09 21:32:45,117 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 35 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-01-09 21:32:45,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 252 transitions, 597 flow [2025-01-09 21:32:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-01-09 21:32:45,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9205219454329775 [2025-01-09 21:32:45,120 INFO L175 Difference]: Start difference. First operand has 248 places, 241 transitions, 496 flow. Second operand 3 states and 776 transitions. [2025-01-09 21:32:45,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 252 transitions, 597 flow [2025-01-09 21:32:45,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 252 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:45,124 INFO L231 Difference]: Finished difference. Result has 248 places, 240 transitions, 497 flow [2025-01-09 21:32:45,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=248, PETRI_TRANSITIONS=240} [2025-01-09 21:32:45,126 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places. [2025-01-09 21:32:45,127 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 497 flow [2025-01-09 21:32:45,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:45,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:45,128 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:32:45,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:45,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:45,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:45,129 INFO L85 PathProgramCache]: Analyzing trace with hash -790920882, now seen corresponding path program 1 times [2025-01-09 21:32:45,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:45,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152650464] [2025-01-09 21:32:45,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:45,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:45,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:32:45,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:32:45,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:45,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152650464] [2025-01-09 21:32:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152650464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468907370] [2025-01-09 21:32:45,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:45,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:45,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 281 [2025-01-09 21:32:45,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:45,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 281 [2025-01-09 21:32:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,147 INFO L124 PetriNetUnfolderBase]: 2594/8243 cut-off events. [2025-01-09 21:32:46,148 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2025-01-09 21:32:46,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12262 conditions, 8243 events. 2594/8243 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 81032 event pairs, 1134 based on Foata normal form. 0/7322 useless extension candidates. Maximal degree in co-relation 8701. Up to 1658 conditions per place. [2025-01-09 21:32:46,225 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 34 selfloop transitions, 1 changer transitions 0/251 dead transitions. [2025-01-09 21:32:46,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 251 transitions, 594 flow [2025-01-09 21:32:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-01-09 21:32:46,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252669039145908 [2025-01-09 21:32:46,227 INFO L175 Difference]: Start difference. First operand has 248 places, 240 transitions, 497 flow. Second operand 3 states and 780 transitions. [2025-01-09 21:32:46,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 251 transitions, 594 flow [2025-01-09 21:32:46,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 251 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:46,233 INFO L231 Difference]: Finished difference. Result has 247 places, 239 transitions, 493 flow [2025-01-09 21:32:46,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=247, PETRI_TRANSITIONS=239} [2025-01-09 21:32:46,234 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -18 predicate places. [2025-01-09 21:32:46,234 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 239 transitions, 493 flow [2025-01-09 21:32:46,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:46,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 369028398, now seen corresponding path program 1 times [2025-01-09 21:32:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711637284] [2025-01-09 21:32:46,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:32:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:32:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711637284] [2025-01-09 21:32:46,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711637284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748047309] [2025-01-09 21:32:46,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 281 [2025-01-09 21:32:46,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 239 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:46,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 281 [2025-01-09 21:32:46,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:47,092 INFO L124 PetriNetUnfolderBase]: 3096/10754 cut-off events. [2025-01-09 21:32:47,093 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-01-09 21:32:47,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15036 conditions, 10754 events. 3096/10754 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 112822 event pairs, 2108 based on Foata normal form. 0/9404 useless extension candidates. Maximal degree in co-relation 12647. Up to 2956 conditions per place. [2025-01-09 21:32:47,169 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 35 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2025-01-09 21:32:47,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 250 transitions, 593 flow [2025-01-09 21:32:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-01-09 21:32:47,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9205219454329775 [2025-01-09 21:32:47,171 INFO L175 Difference]: Start difference. First operand has 247 places, 239 transitions, 493 flow. Second operand 3 states and 776 transitions. [2025-01-09 21:32:47,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 250 transitions, 593 flow [2025-01-09 21:32:47,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 250 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:47,175 INFO L231 Difference]: Finished difference. Result has 247 places, 238 transitions, 494 flow [2025-01-09 21:32:47,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=247, PETRI_TRANSITIONS=238} [2025-01-09 21:32:47,176 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -18 predicate places. [2025-01-09 21:32:47,177 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 238 transitions, 494 flow [2025-01-09 21:32:47,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:47,177 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:32:47,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:47,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:32:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -156299023, now seen corresponding path program 1 times [2025-01-09 21:32:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:47,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706376141] [2025-01-09 21:32:47,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:47,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:32:47,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:32:47,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:47,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706376141] [2025-01-09 21:32:47,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706376141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:47,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:47,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17169323] [2025-01-09 21:32:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:47,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:47,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:47,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:47,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 281 [2025-01-09 21:32:47,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 238 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:47,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:47,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 281 [2025-01-09 21:32:47,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:48,070 INFO L124 PetriNetUnfolderBase]: 2448/9505 cut-off events. [2025-01-09 21:32:48,070 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2025-01-09 21:32:48,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13019 conditions, 9505 events. 2448/9505 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 99944 event pairs, 1136 based on Foata normal form. 0/8455 useless extension candidates. Maximal degree in co-relation 10630. Up to 1621 conditions per place. [2025-01-09 21:32:48,120 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 0 selfloop transitions, 0 changer transitions 249/249 dead transitions. [2025-01-09 21:32:48,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 249 transitions, 590 flow [2025-01-09 21:32:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-01-09 21:32:48,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252669039145908 [2025-01-09 21:32:48,123 INFO L175 Difference]: Start difference. First operand has 247 places, 238 transitions, 494 flow. Second operand 3 states and 780 transitions. [2025-01-09 21:32:48,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 249 transitions, 590 flow [2025-01-09 21:32:48,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 249 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:48,125 INFO L231 Difference]: Finished difference. Result has 246 places, 0 transitions, 0 flow [2025-01-09 21:32:48,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=246, PETRI_TRANSITIONS=0} [2025-01-09 21:32:48,126 INFO L279 CegarLoopForPetriNet]: 265 programPoint places, -19 predicate places. [2025-01-09 21:32:48,126 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 0 transitions, 0 flow [2025-01-09 21:32:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:48,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-01-09 21:32:48,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-01-09 21:32:48,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-01-09 21:32:48,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:48,135 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:48,139 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:48,139 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:48,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:48 BasicIcfg [2025-01-09 21:32:48,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:48,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:48,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:48,143 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:48,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:30" (3/4) ... [2025-01-09 21:32:48,145 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:48,147 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:48,147 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:48,147 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:48,147 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:48,147 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-01-09 21:32:48,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-01-09 21:32:48,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:48,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:32:48,150 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:48,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:48,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:48,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:48,203 INFO L158 Benchmark]: Toolchain (without parser) took 18274.10ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 122.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 516.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:48,203 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:48,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.78ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:48,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.59ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 108.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:48,204 INFO L158 Benchmark]: Boogie Preprocessor took 22.92ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:48,204 INFO L158 Benchmark]: RCFGBuilder took 419.05ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 85.4MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:48,204 INFO L158 Benchmark]: TraceAbstraction took 17536.16ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 84.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 735.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:48,204 INFO L158 Benchmark]: Witness Printer took 59.81ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:48,205 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.91ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.78ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.59ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 108.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.92ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 419.05ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 85.4MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17536.16ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 84.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 735.1MB. Max. memory is 16.1GB. * Witness Printer took 59.81ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 54]: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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 11 procedures, 406 locations, 30 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: 17.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 920 IncrementalHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 69 mSDtfsCounter, 920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:48,217 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