./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/pthread-race-challenges/thread-join-counter-outer-race-4.i', '-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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb'] 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/pthread-race-challenges/thread-join-counter-outer-race-4.i -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 cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:50:20,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:50:20,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:50:20,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:50:20,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:50:20,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:50:20,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:50:20,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:50:20,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:50:20,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:50:20,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:50:20,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:50:20,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:50:20,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:50:20,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:50:20,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:50:20,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:50:20,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:50:20,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:50:20,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:50:20,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:50:20,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:50:20,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:50:20,868 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 -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-07 15:50:21,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:50:21,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:50:21,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:50:21,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:50:21,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:50:21,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-07 15:50:22,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:50:22,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:50:22,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-07 15:50:22,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a0c0ea95/dab048bd051541c4b1d0ee46abf43613/FLAG2ad3716cc [2024-11-07 15:50:22,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a0c0ea95/dab048bd051541c4b1d0ee46abf43613 [2024-11-07 15:50:22,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:50:22,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:50:22,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:50:22,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:50:22,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:50:22,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:22" (1/1) ... [2024-11-07 15:50:22,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e954655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:22, skipping insertion in model container [2024-11-07 15:50:22,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:22" (1/1) ... [2024-11-07 15:50:22,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:50:22,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:50:22,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:50:23,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:50:23,049 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:50:23,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23 WrapperNode [2024-11-07 15:50:23,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:50:23,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:50:23,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:50:23,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:50:23,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,084 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-07 15:50:23,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:50:23,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:50:23,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:50:23,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:50:23,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:50:23,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:50:23,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:50:23,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:50:23,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (1/1) ... [2024-11-07 15:50:23,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:50:23,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:50:23,145 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) [2024-11-07 15:50:23,147 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 [2024-11-07 15:50:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:50:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:50:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:50:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-07 15:50:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-07 15:50:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:50:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:50:23,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:50:23,163 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:50:23,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:50:23,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:50:23,509 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:50:23,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:50:23,540 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:50:23,540 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 15:50:23,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:23 BoogieIcfgContainer [2024-11-07 15:50:23,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:50:23,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:50:23,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:50:23,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:50:23,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:50:22" (1/3) ... [2024-11-07 15:50:23,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8693a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:50:23, skipping insertion in model container [2024-11-07 15:50:23,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:23" (2/3) ... [2024-11-07 15:50:23,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8693a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:50:23, skipping insertion in model container [2024-11-07 15:50:23,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:23" (3/3) ... [2024-11-07 15:50:23,559 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-07 15:50:23,568 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:50:23,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 15:50:23,569 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:50:23,617 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:50:23,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow [2024-11-07 15:50:23,713 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events. [2024-11-07 15:50:23,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:23,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-07 15:50:23,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow [2024-11-07 15:50:23,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow [2024-11-07 15:50:23,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:50:23,747 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;@11c95aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:50:23,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-07 15:50:23,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:50:23,782 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-07 15:50:23,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:23,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:23,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:23,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1558289720, now seen corresponding path program 1 times [2024-11-07 15:50:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922023063] [2024-11-07 15:50:23,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922023063] [2024-11-07 15:50:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922023063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030469027] [2024-11-07 15:50:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:24,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:24,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:24,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-07 15:50:24,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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) [2024-11-07 15:50:24,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:24,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-07 15:50:24,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:24,317 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2024-11-07 15:50:24,317 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:50:24,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3162 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2024-11-07 15:50:24,324 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2024-11-07 15:50:24,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2024-11-07 15:50:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-07 15:50:24,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241 [2024-11-07 15:50:24,338 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions. [2024-11-07 15:50:24,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2024-11-07 15:50:24,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:50:24,348 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2024-11-07 15:50:24,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-07 15:50:24,354 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-07 15:50:24,354 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2024-11-07 15:50:24,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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) [2024-11-07 15:50:24,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:24,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:50:24,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -393361375, now seen corresponding path program 1 times [2024-11-07 15:50:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796864528] [2024-11-07 15:50:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796864528] [2024-11-07 15:50:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796864528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:24,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242410197] [2024-11-07 15:50:24,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:24,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:24,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-07 15:50:24,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2024-11-07 15:50:24,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:24,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-07 15:50:24,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:24,633 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2024-11-07 15:50:24,633 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-07 15:50:24,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4213 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2024-11-07 15:50:24,637 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2024-11-07 15:50:24,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2024-11-07 15:50:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-11-07 15:50:24,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023 [2024-11-07 15:50:24,638 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2024-11-07 15:50:24,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2024-11-07 15:50:24,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:24,645 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2024-11-07 15:50:24,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2024-11-07 15:50:24,647 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-07 15:50:24,647 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2024-11-07 15:50:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2024-11-07 15:50:24,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:24,647 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:24,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:50:24,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:24,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1871831431, now seen corresponding path program 1 times [2024-11-07 15:50:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656857202] [2024-11-07 15:50:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:24,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656857202] [2024-11-07 15:50:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656857202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:24,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:24,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478684376] [2024-11-07 15:50:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:24,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232 [2024-11-07 15:50:24,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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) [2024-11-07 15:50:24,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:24,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232 [2024-11-07 15:50:24,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:24,831 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2024-11-07 15:50:24,831 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-07 15:50:24,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2024-11-07 15:50:24,833 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2024-11-07 15:50:24,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2024-11-07 15:50:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-07 15:50:24,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2024-11-07 15:50:24,836 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2024-11-07 15:50:24,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2024-11-07 15:50:24,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:24,841 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2024-11-07 15:50:24,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-07 15:50:24,842 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2024-11-07 15:50:24,842 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2024-11-07 15:50:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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) [2024-11-07 15:50:24,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:24,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:50:24,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:24,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2000284448, now seen corresponding path program 1 times [2024-11-07 15:50:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963031340] [2024-11-07 15:50:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963031340] [2024-11-07 15:50:24,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963031340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:24,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911007281] [2024-11-07 15:50:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:24,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:24,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:24,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2024-11-07 15:50:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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) [2024-11-07 15:50:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:24,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2024-11-07 15:50:24,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:25,042 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2024-11-07 15:50:25,043 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-07 15:50:25,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3947 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2024-11-07 15:50:25,045 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-11-07 15:50:25,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2024-11-07 15:50:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-07 15:50:25,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517 [2024-11-07 15:50:25,049 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2024-11-07 15:50:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2024-11-07 15:50:25,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:25,054 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2024-11-07 15:50:25,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-11-07 15:50:25,055 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2024-11-07 15:50:25,055 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2024-11-07 15:50:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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) [2024-11-07 15:50:25,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:25,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:25,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:50:25,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:25,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:25,057 INFO L85 PathProgramCache]: Analyzing trace with hash 319446888, now seen corresponding path program 1 times [2024-11-07 15:50:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:25,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458793474] [2024-11-07 15:50:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:25,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458793474] [2024-11-07 15:50:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458793474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:25,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863940411] [2024-11-07 15:50:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:25,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:25,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-07 15:50:25,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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) [2024-11-07 15:50:25,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:25,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-07 15:50:25,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:25,278 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2024-11-07 15:50:25,278 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2024-11-07 15:50:25,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5124 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2024-11-07 15:50:25,281 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2024-11-07 15:50:25,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2024-11-07 15:50:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-07 15:50:25,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702 [2024-11-07 15:50:25,286 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2024-11-07 15:50:25,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2024-11-07 15:50:25,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:25,292 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2024-11-07 15:50:25,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2024-11-07 15:50:25,294 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-07 15:50:25,295 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2024-11-07 15:50:25,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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) [2024-11-07 15:50:25,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:25,295 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:25,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:50:25,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2093932926, now seen corresponding path program 1 times [2024-11-07 15:50:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073443651] [2024-11-07 15:50:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:25,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:25,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:50:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:25,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:50:25,428 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:50:25,429 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-07 15:50:25,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-07 15:50:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-07 15:50:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-07 15:50:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-07 15:50:25,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-07 15:50:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-07 15:50:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-07 15:50:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-07 15:50:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-07 15:50:25,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-07 15:50:25,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:50:25,434 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 15:50:25,436 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:50:25,436 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:50:25,455 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:50:25,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow [2024-11-07 15:50:25,486 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events. [2024-11-07 15:50:25,486 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:50:25,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2024-11-07 15:50:25,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow [2024-11-07 15:50:25,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow [2024-11-07 15:50:25,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:50:25,491 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;@11c95aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:50:25,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 15:50:25,500 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:50:25,501 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-07 15:50:25,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:25,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:25,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:25,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1014442248, now seen corresponding path program 1 times [2024-11-07 15:50:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287510534] [2024-11-07 15:50:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:25,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287510534] [2024-11-07 15:50:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287510534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:25,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597520137] [2024-11-07 15:50:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:25,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:25,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262 [2024-11-07 15:50:25,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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) [2024-11-07 15:50:25,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:25,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262 [2024-11-07 15:50:25,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:26,313 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2024-11-07 15:50:26,313 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-07 15:50:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63917 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2024-11-07 15:50:26,347 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2024-11-07 15:50:26,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2024-11-07 15:50:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-07 15:50:26,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2024-11-07 15:50:26,367 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions. [2024-11-07 15:50:26,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2024-11-07 15:50:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:50:26,371 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2024-11-07 15:50:26,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2024-11-07 15:50:26,373 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2024-11-07 15:50:26,373 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2024-11-07 15:50:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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) [2024-11-07 15:50:26,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:26,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:26,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:50:26,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 755746279, now seen corresponding path program 1 times [2024-11-07 15:50:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641295103] [2024-11-07 15:50:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:26,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641295103] [2024-11-07 15:50:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641295103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804638835] [2024-11-07 15:50:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:26,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262 [2024-11-07 15:50:26,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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) [2024-11-07 15:50:26,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:26,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262 [2024-11-07 15:50:26,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:27,389 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2024-11-07 15:50:27,389 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2024-11-07 15:50:27,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 88093 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2024-11-07 15:50:27,438 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2024-11-07 15:50:27,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2024-11-07 15:50:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-11-07 15:50:27,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506 [2024-11-07 15:50:27,441 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2024-11-07 15:50:27,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2024-11-07 15:50:27,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:27,452 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2024-11-07 15:50:27,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2024-11-07 15:50:27,453 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-07 15:50:27,454 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2024-11-07 15:50:27,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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) [2024-11-07 15:50:27,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:27,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:27,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:50:27,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -609232263, now seen corresponding path program 1 times [2024-11-07 15:50:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261140792] [2024-11-07 15:50:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261140792] [2024-11-07 15:50:27,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261140792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:27,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:27,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952863106] [2024-11-07 15:50:27,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:27,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:27,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:27,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262 [2024-11-07 15:50:27,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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) [2024-11-07 15:50:27,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:27,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262 [2024-11-07 15:50:27,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:28,568 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2024-11-07 15:50:28,569 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2024-11-07 15:50:28,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 82748 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2024-11-07 15:50:28,614 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2024-11-07 15:50:28,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2024-11-07 15:50:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-07 15:50:28,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-07 15:50:28,617 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2024-11-07 15:50:28,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2024-11-07 15:50:28,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:28,626 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2024-11-07 15:50:28,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2024-11-07 15:50:28,627 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2024-11-07 15:50:28,627 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2024-11-07 15:50:28,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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) [2024-11-07 15:50:28,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:28,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:28,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:50:28,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:28,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1402832215, now seen corresponding path program 1 times [2024-11-07 15:50:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643503500] [2024-11-07 15:50:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643503500] [2024-11-07 15:50:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643503500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:28,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:28,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591326615] [2024-11-07 15:50:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:28,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:28,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:28,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:28,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-07 15:50:28,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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) [2024-11-07 15:50:28,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:28,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-07 15:50:28,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:29,512 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2024-11-07 15:50:29,513 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2024-11-07 15:50:29,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113160 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2024-11-07 15:50:29,548 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2024-11-07 15:50:29,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2024-11-07 15:50:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-07 15:50:29,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-07 15:50:29,551 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2024-11-07 15:50:29,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2024-11-07 15:50:29,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:29,558 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2024-11-07 15:50:29,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2024-11-07 15:50:29,558 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2024-11-07 15:50:29,559 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2024-11-07 15:50:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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) [2024-11-07 15:50:29,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:29,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:50:29,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -434774543, now seen corresponding path program 1 times [2024-11-07 15:50:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75838520] [2024-11-07 15:50:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75838520] [2024-11-07 15:50:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75838520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:29,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:29,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504006941] [2024-11-07 15:50:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:29,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:29,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:29,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-07 15:50:29,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2024-11-07 15:50:29,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:29,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-07 15:50:29,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:30,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][270], [281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-07 15:50:30,621 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-07 15:50:30,621 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-07 15:50:30,622 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-07 15:50:30,622 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-07 15:50:30,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [281#true, 38#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-07 15:50:30,718 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-07 15:50:30,718 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:30,718 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:30,718 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-07 15:50:30,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [260#L697-3true, 281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-07 15:50:30,753 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-07 15:50:30,753 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-07 15:50:30,753 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-07 15:50:30,753 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-07 15:50:30,876 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2024-11-07 15:50:30,877 INFO L125 PetriNetUnfolderBase]: For 5573/5897 co-relation queries the response was YES. [2024-11-07 15:50:30,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5573/5897 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 146600 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2024-11-07 15:50:30,923 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2024-11-07 15:50:30,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2024-11-07 15:50:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-07 15:50:30,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2024-11-07 15:50:30,925 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2024-11-07 15:50:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2024-11-07 15:50:30,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:30,931 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2024-11-07 15:50:30,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2024-11-07 15:50:30,932 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-07 15:50:30,932 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2024-11-07 15:50:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2024-11-07 15:50:30,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:30,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:30,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:50:30,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:30,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1143101991, now seen corresponding path program 1 times [2024-11-07 15:50:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:30,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502403499] [2024-11-07 15:50:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502403499] [2024-11-07 15:50:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502403499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:50:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119069790] [2024-11-07 15:50:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:31,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:50:31,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:50:31,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:50:31,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 15:50:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:31,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:50:31,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:50:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:31,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:50:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119069790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:50:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 15:50:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120981506] [2024-11-07 15:50:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:31,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:50:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:50:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:50:31,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-07 15:50:31,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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) [2024-11-07 15:50:31,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:31,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-07 15:50:31,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:33,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-07 15:50:33,115 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-07 15:50:33,115 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-07 15:50:33,115 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-07 15:50:33,115 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-07 15:50:33,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true, 295#(<= 1 ~threads_alive~0)]) [2024-11-07 15:50:33,118 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-07 15:50:33,118 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-07 15:50:33,118 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-07 15:50:33,118 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-07 15:50:33,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-07 15:50:33,299 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-07 15:50:33,299 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:33,299 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:33,299 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-07 15:50:33,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, 295#(<= 1 ~threads_alive~0), Black: 266#true]) [2024-11-07 15:50:33,301 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-07 15:50:33,301 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:33,301 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:33,301 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-07 15:50:33,792 INFO L124 PetriNetUnfolderBase]: 5622/18915 cut-off events. [2024-11-07 15:50:33,792 INFO L125 PetriNetUnfolderBase]: For 9477/10449 co-relation queries the response was YES. [2024-11-07 15:50:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38392 conditions, 18915 events. 5622/18915 cut-off events. For 9477/10449 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 229256 event pairs, 1257 based on Foata normal form. 132/17167 useless extension candidates. Maximal degree in co-relation 30507. Up to 3127 conditions per place. [2024-11-07 15:50:33,860 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 69 selfloop transitions, 14 changer transitions 3/361 dead transitions. [2024-11-07 15:50:33,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 361 transitions, 1219 flow [2024-11-07 15:50:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:50:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 15:50:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1718 transitions. [2024-11-07 15:50:33,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367502726281353 [2024-11-07 15:50:33,863 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 7 states and 1718 transitions. [2024-11-07 15:50:33,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 361 transitions, 1219 flow [2024-11-07 15:50:33,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 361 transitions, 1181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:33,899 INFO L231 Difference]: Finished difference. Result has 281 places, 315 transitions, 969 flow [2024-11-07 15:50:33,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=969, PETRI_PLACES=281, PETRI_TRANSITIONS=315} [2024-11-07 15:50:33,900 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 18 predicate places. [2024-11-07 15:50:33,900 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 315 transitions, 969 flow [2024-11-07 15:50:33,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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) [2024-11-07 15:50:33,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:33,901 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:33,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 15:50:34,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 15:50:34,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1106641400, now seen corresponding path program 1 times [2024-11-07 15:50:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568839709] [2024-11-07 15:50:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:50:34,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568839709] [2024-11-07 15:50:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568839709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:50:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917981842] [2024-11-07 15:50:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:34,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:50:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:50:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:50:34,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-07 15:50:34,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 315 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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) [2024-11-07 15:50:34,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:34,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-07 15:50:34,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:34,580 INFO L124 PetriNetUnfolderBase]: 216/1813 cut-off events. [2024-11-07 15:50:34,581 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-07 15:50:34,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1813 events. 216/1813 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12701 event pairs, 65 based on Foata normal form. 79/1813 useless extension candidates. Maximal degree in co-relation 2647. Up to 212 conditions per place. [2024-11-07 15:50:34,588 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2024-11-07 15:50:34,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 762 flow [2024-11-07 15:50:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:50:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 15:50:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2024-11-07 15:50:34,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015 [2024-11-07 15:50:34,590 INFO L175 Difference]: Start difference. First operand has 281 places, 315 transitions, 969 flow. Second operand 5 states and 1233 transitions. [2024-11-07 15:50:34,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 762 flow [2024-11-07 15:50:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 714 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-07 15:50:34,596 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 677 flow [2024-11-07 15:50:34,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-07 15:50:34,597 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2024-11-07 15:50:34,597 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 677 flow [2024-11-07 15:50:34,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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) [2024-11-07 15:50:34,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:34,598 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:34,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:50:34,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 374705611, now seen corresponding path program 1 times [2024-11-07 15:50:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474443082] [2024-11-07 15:50:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 15:50:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:34,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474443082] [2024-11-07 15:50:34,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474443082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:34,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392550270] [2024-11-07 15:50:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:34,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:34,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:34,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:34,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-07 15:50:34,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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) [2024-11-07 15:50:34,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:34,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-07 15:50:34,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:34,958 INFO L124 PetriNetUnfolderBase]: 647/2737 cut-off events. [2024-11-07 15:50:34,958 INFO L125 PetriNetUnfolderBase]: For 860/872 co-relation queries the response was YES. [2024-11-07 15:50:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2737 events. 647/2737 cut-off events. For 860/872 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 21879 event pairs, 351 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 4638. Up to 908 conditions per place. [2024-11-07 15:50:34,970 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/284 dead transitions. [2024-11-07 15:50:34,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 284 transitions, 811 flow [2024-11-07 15:50:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-07 15:50:34,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2024-11-07 15:50:34,973 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 677 flow. Second operand 3 states and 746 transitions. [2024-11-07 15:50:34,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 284 transitions, 811 flow [2024-11-07 15:50:34,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 284 transitions, 790 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 15:50:34,978 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 718 flow [2024-11-07 15:50:34,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2024-11-07 15:50:34,980 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-07 15:50:34,980 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 718 flow [2024-11-07 15:50:34,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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) [2024-11-07 15:50:34,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:34,980 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:34,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:50:34,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:34,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash 773386076, now seen corresponding path program 1 times [2024-11-07 15:50:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167434454] [2024-11-07 15:50:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:34,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 15:50:35,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167434454] [2024-11-07 15:50:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167434454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:35,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:50:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607372323] [2024-11-07 15:50:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:35,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:35,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:35,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262 [2024-11-07 15:50:35,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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) [2024-11-07 15:50:35,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:35,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262 [2024-11-07 15:50:35,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:35,463 INFO L124 PetriNetUnfolderBase]: 335/2645 cut-off events. [2024-11-07 15:50:35,463 INFO L125 PetriNetUnfolderBase]: For 787/854 co-relation queries the response was YES. [2024-11-07 15:50:35,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2645 events. 335/2645 cut-off events. For 787/854 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22776 event pairs, 62 based on Foata normal form. 12/2575 useless extension candidates. Maximal degree in co-relation 3284. Up to 495 conditions per place. [2024-11-07 15:50:35,471 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/287 dead transitions. [2024-11-07 15:50:35,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 287 transitions, 819 flow [2024-11-07 15:50:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-07 15:50:35,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888 [2024-11-07 15:50:35,472 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 718 flow. Second operand 3 states and 758 transitions. [2024-11-07 15:50:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 287 transitions, 819 flow [2024-11-07 15:50:35,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 287 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:35,477 INFO L231 Difference]: Finished difference. Result has 275 places, 281 transitions, 764 flow [2024-11-07 15:50:35,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=275, PETRI_TRANSITIONS=281} [2024-11-07 15:50:35,477 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2024-11-07 15:50:35,477 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 281 transitions, 764 flow [2024-11-07 15:50:35,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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) [2024-11-07 15:50:35,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:35,478 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:35,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:50:35,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:35,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1258401358, now seen corresponding path program 2 times [2024-11-07 15:50:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:35,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112355736] [2024-11-07 15:50:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:50:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112355736] [2024-11-07 15:50:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112355736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:50:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119499072] [2024-11-07 15:50:35,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 15:50:35,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:50:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:50:35,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:50:35,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 15:50:35,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 15:50:35,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 15:50:35,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 15:50:35,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:50:36,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 15:50:36,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 15:50:36,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 15:50:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:50:36,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:50:36,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_1109) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-11-07 15:50:36,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:50:36,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-07 15:50:36,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-07 15:50:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-11-07 15:50:36,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119499072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:50:36,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:50:36,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-07 15:50:36,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591598201] [2024-11-07 15:50:36,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:50:36,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 15:50:36,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:36,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 15:50:36,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-07 15:50:36,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2024-11-07 15:50:36,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 281 transitions, 764 flow. Second operand has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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) [2024-11-07 15:50:36,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:36,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2024-11-07 15:50:36,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:36,793 INFO L124 PetriNetUnfolderBase]: 192/1865 cut-off events. [2024-11-07 15:50:36,794 INFO L125 PetriNetUnfolderBase]: For 618/716 co-relation queries the response was YES. [2024-11-07 15:50:36,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1865 events. 192/1865 cut-off events. For 618/716 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13561 event pairs, 18 based on Foata normal form. 47/1867 useless extension candidates. Maximal degree in co-relation 2320. Up to 247 conditions per place. [2024-11-07 15:50:36,800 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 38 selfloop transitions, 8 changer transitions 2/290 dead transitions. [2024-11-07 15:50:36,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 887 flow [2024-11-07 15:50:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:50:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 15:50:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2024-11-07 15:50:36,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9129770992366413 [2024-11-07 15:50:36,802 INFO L175 Difference]: Start difference. First operand has 275 places, 281 transitions, 764 flow. Second operand 5 states and 1196 transitions. [2024-11-07 15:50:36,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 887 flow [2024-11-07 15:50:36,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 290 transitions, 876 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 15:50:36,807 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 745 flow [2024-11-07 15:50:36,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=745, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-11-07 15:50:36,807 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2024-11-07 15:50:36,807 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 745 flow [2024-11-07 15:50:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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) [2024-11-07 15:50:36,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:36,808 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:36,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 15:50:37,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 15:50:37,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:37,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1925231661, now seen corresponding path program 1 times [2024-11-07 15:50:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:37,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657683513] [2024-11-07 15:50:37,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 15:50:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657683513] [2024-11-07 15:50:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657683513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:37,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:37,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158342021] [2024-11-07 15:50:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:37,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:37,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-07 15:50:37,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-11-07 15:50:37,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:37,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-07 15:50:37,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:37,257 INFO L124 PetriNetUnfolderBase]: 304/2282 cut-off events. [2024-11-07 15:50:37,258 INFO L125 PetriNetUnfolderBase]: For 1306/1398 co-relation queries the response was YES. [2024-11-07 15:50:37,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2282 events. 304/2282 cut-off events. For 1306/1398 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 18038 event pairs, 154 based on Foata normal form. 3/2224 useless extension candidates. Maximal degree in co-relation 3773. Up to 664 conditions per place. [2024-11-07 15:50:37,265 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 2/279 dead transitions. [2024-11-07 15:50:37,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 279 transitions, 839 flow [2024-11-07 15:50:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-11-07 15:50:37,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613 [2024-11-07 15:50:37,267 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 745 flow. Second operand 3 states and 725 transitions. [2024-11-07 15:50:37,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 279 transitions, 839 flow [2024-11-07 15:50:37,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 279 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 15:50:37,271 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 730 flow [2024-11-07 15:50:37,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2024-11-07 15:50:37,272 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2024-11-07 15:50:37,272 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 730 flow [2024-11-07 15:50:37,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-11-07 15:50:37,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:37,272 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:37,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:50:37,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:37,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 608177901, now seen corresponding path program 1 times [2024-11-07 15:50:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785455368] [2024-11-07 15:50:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:37,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:50:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:37,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:50:37,337 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-07 15:50:37,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-07 15:50:37,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:50:37,338 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:37,339 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:50:37,339 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 15:50:37,357 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:50:37,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow [2024-11-07 15:50:37,394 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events. [2024-11-07 15:50:37,394 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 15:50:37,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place. [2024-11-07 15:50:37,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow [2024-11-07 15:50:37,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow [2024-11-07 15:50:37,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:50:37,397 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;@11c95aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:50:37,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-07 15:50:37,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:50:37,402 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-07 15:50:37,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:37,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:37,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:37,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-07 15:50:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash -176942728, now seen corresponding path program 1 times [2024-11-07 15:50:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531391202] [2024-11-07 15:50:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531391202] [2024-11-07 15:50:37,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531391202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:37,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:37,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:37,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566201124] [2024-11-07 15:50:37,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:37,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:37,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:37,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:37,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292 [2024-11-07 15:50:37,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 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) [2024-11-07 15:50:37,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:37,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292 [2024-11-07 15:50:37,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:44,659 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2024-11-07 15:50:44,660 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-07 15:50:44,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2925. Compared 957543 event pairs, 14941 based on Foata normal form. 986/71986 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2024-11-07 15:50:45,107 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2024-11-07 15:50:45,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2024-11-07 15:50:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2024-11-07 15:50:45,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2024-11-07 15:50:45,109 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 602 flow. Second operand 3 states and 831 transitions. [2024-11-07 15:50:45,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2024-11-07 15:50:45,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-07 15:50:45,116 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2024-11-07 15:50:45,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2024-11-07 15:50:45,116 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2024-11-07 15:50:45,116 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2024-11-07 15:50:45,117 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) [2024-11-07 15:50:45,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:45,117 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:50:45,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-07 15:50:45,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1511854987, now seen corresponding path program 1 times [2024-11-07 15:50:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128553776] [2024-11-07 15:50:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128553776] [2024-11-07 15:50:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128553776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144559630] [2024-11-07 15:50:45,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:45,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:45,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:45,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:45,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 292 [2024-11-07 15:50:45,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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) [2024-11-07 15:50:45,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:45,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 292 [2024-11-07 15:50:45,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:48,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:48,602 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-07 15:50:48,602 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:48,602 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:48,602 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:48,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:48,603 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:48,603 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:48,603 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,008 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:49,008 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-07 15:50:49,008 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,008 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,008 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,008 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-07 15:50:49,010 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:49,010 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-07 15:50:49,010 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,010 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,010 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-07 15:50:49,010 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-07 15:50:49,295 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:49,295 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-07 15:50:49,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:49,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:49,295 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-07 15:50:49,295 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:49,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:49,296 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-07 15:50:49,296 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-07 15:50:49,296 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:49,296 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-07 15:50:50,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [33#L691-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:50,445 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-07 15:50:50,445 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-07 15:50:50,445 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-07 15:50:50,445 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-07 15:50:50,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L691-3true, 44#L695-5true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:50,447 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-07 15:50:50,447 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-07 15:50:50,447 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-07 15:50:50,447 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-07 15:50:51,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:51,041 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-07 15:50:51,041 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-07 15:50:51,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:51,041 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-07 15:50:51,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:51,042 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-07 15:50:51,042 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:51,042 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-07 15:50:51,042 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:51,632 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:51,632 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:51,632 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,632 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,822 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:51,822 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-07 15:50:51,822 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-07 15:50:51,822 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,822 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,822 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,824 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:51,824 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-07 15:50:51,824 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,824 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-07 15:50:51,824 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:51,824 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:52,033 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:52,033 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-07 15:50:52,033 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:52,035 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:52,035 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:52,035 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,035 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,246 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:52,246 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-07 15:50:52,246 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,246 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-07 15:50:52,246 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,246 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,248 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:52,248 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-07 15:50:52,248 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-07 15:50:52,248 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,248 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,248 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-07 15:50:52,658 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:52,659 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 262#L694-3true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:52,659 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,659 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-07 15:50:52,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [156#L693-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:52,880 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-07 15:50:52,880 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-07 15:50:52,880 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-07 15:50:52,880 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-07 15:50:52,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 156#L693-3true, 44#L695-5true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:52,882 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-07 15:50:52,882 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-07 15:50:52,882 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-07 15:50:52,882 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-07 15:50:53,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [262#L694-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:53,546 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-07 15:50:53,546 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-07 15:50:53,546 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-07 15:50:53,546 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-07 15:50:53,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 44#L695-5true, 262#L694-3true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-07 15:50:53,550 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-07 15:50:53,550 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-07 15:50:53,550 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-07 15:50:53,550 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-07 15:50:53,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:53,850 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-07 15:50:53,850 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-07 15:50:53,850 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-07 15:50:53,850 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-07 15:50:53,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:53,854 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-07 15:50:53,854 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-07 15:50:53,854 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-07 15:50:53,855 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-07 15:50:54,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 262#L694-3true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:54,420 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-07 15:50:54,420 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-07 15:50:54,420 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-07 15:50:54,420 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-07 15:50:54,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 262#L694-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:54,425 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-07 15:50:54,425 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-07 15:50:54,425 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-07 15:50:54,425 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-07 15:50:55,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [124#L697-3true, 303#true, 292#true, 157#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:55,624 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-07 15:50:55,624 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-07 15:50:55,624 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-07 15:50:55,624 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-07 15:50:55,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, 219#L712-1true, Black: 298#true, 273#L697-3true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-07 15:50:55,625 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-07 15:50:55,625 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-07 15:50:55,625 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-07 15:50:55,625 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-07 15:50:55,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 273#L697-3true]) [2024-11-07 15:50:55,627 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-07 15:50:55,627 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-07 15:50:55,627 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-07 15:50:55,627 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-07 15:50:55,924 INFO L124 PetriNetUnfolderBase]: 38618/99725 cut-off events. [2024-11-07 15:50:55,924 INFO L125 PetriNetUnfolderBase]: For 39987/44110 co-relation queries the response was YES. [2024-11-07 15:50:56,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192268 conditions, 99725 events. 38618/99725 cut-off events. For 39987/44110 co-relation queries the response was YES. Maximal size of possible extension queue 3203. Compared 1335002 event pairs, 24930 based on Foata normal form. 654/90669 useless extension candidates. Maximal degree in co-relation 190021. Up to 46398 conditions per place. [2024-11-07 15:50:56,491 INFO L140 encePairwiseOnDemand]: 282/292 looper letters, 55 selfloop transitions, 16 changer transitions 0/328 dead transitions. [2024-11-07 15:50:56,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 328 transitions, 944 flow [2024-11-07 15:50:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2024-11-07 15:50:56,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2024-11-07 15:50:56,493 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 714 flow. Second operand 3 states and 816 transitions. [2024-11-07 15:50:56,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 328 transitions, 944 flow [2024-11-07 15:50:56,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 328 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:56,627 INFO L231 Difference]: Finished difference. Result has 300 places, 316 transitions, 832 flow [2024-11-07 15:50:56,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=300, PETRI_TRANSITIONS=316} [2024-11-07 15:50:56,628 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 5 predicate places. [2024-11-07 15:50:56,628 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 316 transitions, 832 flow [2024-11-07 15:50:56,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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) [2024-11-07 15:50:56,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:56,629 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:56,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:50:56,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-07 15:50:56,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1355301497, now seen corresponding path program 1 times [2024-11-07 15:50:56,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:56,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018279057] [2024-11-07 15:50:56,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:50:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:56,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018279057] [2024-11-07 15:50:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018279057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:56,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122273366] [2024-11-07 15:50:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:56,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 292 [2024-11-07 15:50:56,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 316 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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) [2024-11-07 15:50:56,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:56,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 292 [2024-11-07 15:50:56,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:59,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 292#true, 303#true, 294#true, 79#L695-1true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:59,989 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2024-11-07 15:50:59,989 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-07 15:50:59,989 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-07 15:50:59,989 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-07 15:50:59,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 292#true, 303#true, 221#L695-2true, 294#true, 135#L695-1true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:50:59,990 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2024-11-07 15:50:59,990 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-07 15:50:59,990 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-07 15:50:59,990 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-07 15:51:00,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 292#true, 303#true, 294#true, 221#L695-2true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-07 15:51:00,191 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2024-11-07 15:51:00,191 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-07 15:51:00,191 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-07 15:51:00,191 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-07 15:51:06,409 INFO L124 PetriNetUnfolderBase]: 30650/91597 cut-off events. [2024-11-07 15:51:06,409 INFO L125 PetriNetUnfolderBase]: For 15159/45085 co-relation queries the response was YES. [2024-11-07 15:51:06,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158995 conditions, 91597 events. 30650/91597 cut-off events. For 15159/45085 co-relation queries the response was YES. Maximal size of possible extension queue 3205. Compared 1320329 event pairs, 18292 based on Foata normal form. 49/78852 useless extension candidates. Maximal degree in co-relation 157149. Up to 23313 conditions per place. [2024-11-07 15:51:07,002 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 38 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2024-11-07 15:51:07,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 332 transitions, 950 flow [2024-11-07 15:51:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:51:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:51:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2024-11-07 15:51:07,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2024-11-07 15:51:07,004 INFO L175 Difference]: Start difference. First operand has 300 places, 316 transitions, 832 flow. Second operand 3 states and 830 transitions. [2024-11-07 15:51:07,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 332 transitions, 950 flow [2024-11-07 15:51:07,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 332 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:51:07,183 INFO L231 Difference]: Finished difference. Result has 302 places, 320 transitions, 838 flow [2024-11-07 15:51:07,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=302, PETRI_TRANSITIONS=320} [2024-11-07 15:51:07,184 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 7 predicate places. [2024-11-07 15:51:07,184 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 320 transitions, 838 flow [2024-11-07 15:51:07,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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) [2024-11-07 15:51:07,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:51:07,184 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:51:07,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:51:07,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-07 15:51:07,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:51:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash 703079306, now seen corresponding path program 1 times [2024-11-07 15:51:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:51:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722343368] [2024-11-07 15:51:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:51:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:51:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:51:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:51:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:51:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722343368] [2024-11-07 15:51:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722343368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:51:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:51:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:51:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910197077] [2024-11-07 15:51:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:51:07,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:51:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:51:07,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:51:07,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:51:07,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 292 [2024-11-07 15:51:07,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 320 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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) [2024-11-07 15:51:07,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:51:07,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 292 [2024-11-07 15:51:07,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand