./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_19-callback_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 02:46:21,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 02:46:21,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 02:46:21,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 02:46:21,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 02:46:21,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 02:46:21,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 02:46:21,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 02:46:21,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 02:46:21,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 02:46:21,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 02:46:21,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 02:46:21,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 02:46:21,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 02:46:21,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 02:46:21,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 02:46:21,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 02:46:21,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 02:46:21,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 02:46:21,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 02:46:21,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 02:46:21,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 02:46:21,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 02:46:21,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 02:46:21,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 02:46:21,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 02:46:21,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 02:46:21,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 02:46:21,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 02:46:21,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 02:46:21,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 02:46:21,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 02:46:21,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 02:46:21,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 02:46:21,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 02:46:21,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 02:46:21,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 02:46:21,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 02:46:21,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 02:46:21,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 02:46:21,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 02:46:21,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 02:46:21,223 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 02:46:21,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 02:46:21,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 02:46:21,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 02:46:21,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 02:46:21,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 02:46:21,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 02:46:21,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 02:46:21,225 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 02:46:21,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 02:46:21,225 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 02:46:21,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 02:46:21,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 02:46:21,226 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 02:46:21,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 02:46:21,227 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 02:46:21,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 02:46:21,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 02:46:21,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 02:46:21,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 02:46:21,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:46:21,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 02:46:21,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 02:46:21,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 02:46:21,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 02:46:21,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 02:46:21,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 02:46:21,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 02:46:21,229 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 02:46:21,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 02:46:21,229 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 02:46:21,229 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 02:46:21,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 02:46:21,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 02:46:21,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 02:46:21,491 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 02:46:21,491 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 02:46:21,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_19-callback_racing.i [2023-08-29 02:46:22,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 02:46:22,931 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 02:46:22,934 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_19-callback_racing.i [2023-08-29 02:46:22,943 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ee23f7b/84204b41bbc843e08293cad8bdd5bee2/FLAG2b4eca878 [2023-08-29 02:46:22,954 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ee23f7b/84204b41bbc843e08293cad8bdd5bee2 [2023-08-29 02:46:22,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 02:46:22,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 02:46:22,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 02:46:22,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 02:46:22,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 02:46:22,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:46:22" (1/1) ... [2023-08-29 02:46:22,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dee989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:22, skipping insertion in model container [2023-08-29 02:46:22,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:46:22" (1/1) ... [2023-08-29 02:46:22,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 02:46:23,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 02:46:23,248 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_19-callback_racing.i[30212,30225] [2023-08-29 02:46:23,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:46:23,292 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 02:46:23,323 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_19-callback_racing.i[30212,30225] [2023-08-29 02:46:23,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:46:23,375 WARN L667 CHandler]: The function callback is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 02:46:23,381 INFO L208 MainTranslator]: Completed translation [2023-08-29 02:46:23,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23 WrapperNode [2023-08-29 02:46:23,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 02:46:23,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 02:46:23,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 02:46:23,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 02:46:23,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,445 INFO L138 Inliner]: procedures = 173, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 153 [2023-08-29 02:46:23,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 02:46:23,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 02:46:23,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 02:46:23,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 02:46:23,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 02:46:23,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 02:46:23,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 02:46:23,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 02:46:23,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (1/1) ... [2023-08-29 02:46:23,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:46:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:23,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 02:46:23,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 02:46:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 02:46:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 02:46:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 02:46:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 02:46:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 02:46:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 02:46:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 02:46:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 02:46:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 02:46:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 02:46:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 02:46:23,611 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 02:46:23,711 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 02:46:23,713 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 02:46:23,926 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 02:46:23,932 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 02:46:23,933 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-08-29 02:46:23,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:46:23 BoogieIcfgContainer [2023-08-29 02:46:23,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 02:46:23,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 02:46:23,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 02:46:23,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 02:46:23,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:46:22" (1/3) ... [2023-08-29 02:46:23,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:46:23, skipping insertion in model container [2023-08-29 02:46:23,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:46:23" (2/3) ... [2023-08-29 02:46:23,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:46:23, skipping insertion in model container [2023-08-29 02:46:23,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:46:23" (3/3) ... [2023-08-29 02:46:23,940 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2023-08-29 02:46:23,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 02:46:23,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 02:46:23,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-29 02:46:23,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 02:46:24,005 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 02:46:24,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:24,127 INFO L130 PetriNetUnfolder]: 26/251 cut-off events. [2023-08-29 02:46:24,128 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:46:24,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 251 events. 26/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 761 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 125. Up to 6 conditions per place. [2023-08-29 02:46:24,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:24,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:24,143 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:24,150 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:24,158 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:24,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:24,239 INFO L130 PetriNetUnfolder]: 26/251 cut-off events. [2023-08-29 02:46:24,240 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:46:24,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 251 events. 26/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 761 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 125. Up to 6 conditions per place. [2023-08-29 02:46:24,248 INFO L119 LiptonReduction]: Number of co-enabled transitions 4312 [2023-08-29 02:46:27,173 INFO L134 LiptonReduction]: Checked pairs total: 9271 [2023-08-29 02:46:27,174 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-29 02:46:27,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:46:27,200 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:27,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-29 02:46:27,206 INFO L130 PetriNetUnfolder]: 2/8 cut-off events. [2023-08-29 02:46:27,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:46:27,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:27,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:46:27,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-08-29 02:46:27,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash 17370904, now seen corresponding path program 1 times [2023-08-29 02:46:27,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:27,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988510036] [2023-08-29 02:46:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988510036] [2023-08-29 02:46:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988510036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137063585] [2023-08-29 02:46:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:27,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:27,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:27,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 286 [2023-08-29 02:46:27,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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) [2023-08-29 02:46:27,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:27,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 286 [2023-08-29 02:46:27,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:27,535 INFO L130 PetriNetUnfolder]: 97/274 cut-off events. [2023-08-29 02:46:27,535 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:46:27,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 274 events. 97/274 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1150 event pairs, 0 based on Foata normal form. 30/272 useless extension candidates. Maximal degree in co-relation 465. Up to 204 conditions per place. [2023-08-29 02:46:27,537 INFO L137 encePairwiseOnDemand]: 274/286 looper letters, 30 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-29 02:46:27,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 170 flow [2023-08-29 02:46:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-08-29 02:46:27,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5431235431235432 [2023-08-29 02:46:27,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-08-29 02:46:27,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-08-29 02:46:27,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:27,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-08-29 02:46:27,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2023-08-29 02:46:27,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-29 02:46:27,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-29 02:46:27,559 INFO L175 Difference]: Start difference. First operand has 42 places, 50 transitions, 108 flow. Second operand 3 states and 466 transitions. [2023-08-29 02:46:27,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 170 flow [2023-08-29 02:46:27,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:46:27,562 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 91 flow [2023-08-29 02:46:27,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-29 02:46:27,566 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 02:46:27,566 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 91 flow [2023-08-29 02:46:27,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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) [2023-08-29 02:46:27,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:27,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:27,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 02:46:27,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-08-29 02:46:27,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2085854868, now seen corresponding path program 1 times [2023-08-29 02:46:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753275410] [2023-08-29 02:46:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753275410] [2023-08-29 02:46:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753275410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718872085] [2023-08-29 02:46:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:27,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:27,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 286 [2023-08-29 02:46:27,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-29 02:46:27,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:27,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 286 [2023-08-29 02:46:27,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:27,703 INFO L130 PetriNetUnfolder]: 200/460 cut-off events. [2023-08-29 02:46:27,703 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 02:46:27,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 460 events. 200/460 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1830 event pairs, 48 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 901. Up to 251 conditions per place. [2023-08-29 02:46:27,706 INFO L137 encePairwiseOnDemand]: 277/286 looper letters, 43 selfloop transitions, 6 changer transitions 5/59 dead transitions. [2023-08-29 02:46:27,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 242 flow [2023-08-29 02:46:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-29 02:46:27,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2023-08-29 02:46:27,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-29 02:46:27,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-29 02:46:27,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:27,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-29 02:46:27,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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) [2023-08-29 02:46:27,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-29 02:46:27,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-29 02:46:27,717 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 91 flow. Second operand 3 states and 455 transitions. [2023-08-29 02:46:27,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 242 flow [2023-08-29 02:46:27,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:46:27,719 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 121 flow [2023-08-29 02:46:27,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-29 02:46:27,720 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 02:46:27,720 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 121 flow [2023-08-29 02:46:27,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-29 02:46:27,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:27,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:27,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 02:46:27,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-08-29 02:46:27,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1773123124, now seen corresponding path program 1 times [2023-08-29 02:46:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811803195] [2023-08-29 02:46:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811803195] [2023-08-29 02:46:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811803195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:46:27,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39870314] [2023-08-29 02:46:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:27,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:27,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:27,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:46:27,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 02:46:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:27,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:46:27,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:46:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:46:27,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:46:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39870314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:27,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:46:27,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:46:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136256626] [2023-08-29 02:46:27,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:27,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:27,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:46:27,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 286 [2023-08-29 02:46:27,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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) [2023-08-29 02:46:27,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:27,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 286 [2023-08-29 02:46:27,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:28,015 INFO L130 PetriNetUnfolder]: 167/412 cut-off events. [2023-08-29 02:46:28,015 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2023-08-29 02:46:28,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 412 events. 167/412 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1681 event pairs, 110 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 908. Up to 329 conditions per place. [2023-08-29 02:46:28,017 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 35 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-29 02:46:28,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 217 flow [2023-08-29 02:46:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-29 02:46:28,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116550116550117 [2023-08-29 02:46:28,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-29 02:46:28,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-29 02:46:28,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:28,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-29 02:46:28,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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) [2023-08-29 02:46:28,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-29 02:46:28,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-29 02:46:28,029 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 121 flow. Second operand 3 states and 439 transitions. [2023-08-29 02:46:28,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 217 flow [2023-08-29 02:46:28,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:46:28,031 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 141 flow [2023-08-29 02:46:28,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-29 02:46:28,032 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 02:46:28,032 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 141 flow [2023-08-29 02:46:28,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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) [2023-08-29 02:46:28,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:28,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:28,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 02:46:28,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:28,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-08-29 02:46:28,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2077445572, now seen corresponding path program 1 times [2023-08-29 02:46:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:28,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172409017] [2023-08-29 02:46:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172409017] [2023-08-29 02:46:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172409017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:46:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212094350] [2023-08-29 02:46:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:28,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:28,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:28,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:46:28,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 02:46:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:28,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:46:28,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:46:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:28,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:46:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212094350] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:46:28,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:46:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:46:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403143304] [2023-08-29 02:46:28,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:46:28,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:46:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:46:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:46:28,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 286 [2023-08-29 02:46:28,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 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) [2023-08-29 02:46:28,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:28,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 286 [2023-08-29 02:46:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:28,449 INFO L130 PetriNetUnfolder]: 10/34 cut-off events. [2023-08-29 02:46:28,449 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-29 02:46:28,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 34 events. 10/34 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 4 based on Foata normal form. 6/40 useless extension candidates. Maximal degree in co-relation 81. Up to 22 conditions per place. [2023-08-29 02:46:28,449 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2023-08-29 02:46:28,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 17 transitions, 79 flow [2023-08-29 02:46:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:46:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:46:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2023-08-29 02:46:28,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 02:46:28,451 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 572 transitions. [2023-08-29 02:46:28,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 572 transitions. [2023-08-29 02:46:28,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:28,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 572 transitions. [2023-08-29 02:46:28,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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) [2023-08-29 02:46:28,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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) [2023-08-29 02:46:28,454 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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) [2023-08-29 02:46:28,455 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 141 flow. Second operand 4 states and 572 transitions. [2023-08-29 02:46:28,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 17 transitions, 79 flow [2023-08-29 02:46:28,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 67 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-29 02:46:28,455 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-29 02:46:28,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-29 02:46:28,456 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -24 predicate places. [2023-08-29 02:46:28,456 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-29 02:46:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 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) [2023-08-29 02:46:28,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2023-08-29 02:46:28,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-08-29 02:46:28,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-08-29 02:46:28,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-08-29 02:46:28,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-08-29 02:46:28,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-08-29 02:46:28,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-08-29 02:46:28,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-29 02:46:28,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-29 02:46:28,665 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-29 02:46:28,667 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:46:28,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:28,695 INFO L130 PetriNetUnfolder]: 26/251 cut-off events. [2023-08-29 02:46:28,695 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:46:28,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 251 events. 26/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 761 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 125. Up to 6 conditions per place. [2023-08-29 02:46:28,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 159 transitions, 326 flow [2023-08-29 02:46:28,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 154 transitions, 313 flow [2023-08-29 02:46:28,697 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:28,698 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 154 transitions, 313 flow [2023-08-29 02:46:28,698 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 154 transitions, 313 flow [2023-08-29 02:46:28,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 154 transitions, 313 flow [2023-08-29 02:46:28,715 INFO L130 PetriNetUnfolder]: 25/246 cut-off events. [2023-08-29 02:46:28,723 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:46:28,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 246 events. 25/246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 720 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 125. Up to 6 conditions per place. [2023-08-29 02:46:28,726 INFO L119 LiptonReduction]: Number of co-enabled transitions 4312 [2023-08-29 02:46:31,222 INFO L134 LiptonReduction]: Checked pairs total: 9064 [2023-08-29 02:46:31,227 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-29 02:46:31,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:46:31,230 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:31,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:46:31,233 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2023-08-29 02:46:31,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:46:31,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:31,233 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 02:46:31,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:46:31,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1083657872, now seen corresponding path program 1 times [2023-08-29 02:46:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520829081] [2023-08-29 02:46:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:46:31,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:46:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:46:31,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:46:31,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:46:31,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:46:31,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 02:46:31,295 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:46:31,296 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:46:31,296 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:46:31,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 02:46:31,311 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 02:46:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:31,341 INFO L130 PetriNetUnfolder]: 43/397 cut-off events. [2023-08-29 02:46:31,341 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:46:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 397 events. 43/397 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1546 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 253. Up to 9 conditions per place. [2023-08-29 02:46:31,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:31,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:31,345 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:31,345 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:31,346 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:31,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:31,372 INFO L130 PetriNetUnfolder]: 43/397 cut-off events. [2023-08-29 02:46:31,372 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:46:31,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 397 events. 43/397 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1546 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 253. Up to 9 conditions per place. [2023-08-29 02:46:31,380 INFO L119 LiptonReduction]: Number of co-enabled transitions 10076 [2023-08-29 02:46:34,134 INFO L134 LiptonReduction]: Checked pairs total: 27063 [2023-08-29 02:46:34,134 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-29 02:46:34,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:46:34,136 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:34,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-08-29 02:46:34,138 INFO L130 PetriNetUnfolder]: 2/8 cut-off events. [2023-08-29 02:46:34,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:46:34,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:34,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:46:34,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-08-29 02:46:34,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 31871914, now seen corresponding path program 1 times [2023-08-29 02:46:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:34,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492497195] [2023-08-29 02:46:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492497195] [2023-08-29 02:46:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492497195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:34,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:34,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:34,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186268107] [2023-08-29 02:46:34,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:34,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:34,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:34,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:34,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:34,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 322 [2023-08-29 02:46:34,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 66 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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) [2023-08-29 02:46:34,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:34,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 322 [2023-08-29 02:46:34,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:34,359 INFO L130 PetriNetUnfolder]: 1477/2870 cut-off events. [2023-08-29 02:46:34,360 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-29 02:46:34,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 2870 events. 1477/2870 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 18466 event pairs, 1115 based on Foata normal form. 225/2644 useless extension candidates. Maximal degree in co-relation 1886. Up to 2388 conditions per place. [2023-08-29 02:46:34,373 INFO L137 encePairwiseOnDemand]: 307/322 looper letters, 42 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-29 02:46:34,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 230 flow [2023-08-29 02:46:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-29 02:46:34,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5527950310559007 [2023-08-29 02:46:34,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-29 02:46:34,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-29 02:46:34,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:34,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-29 02:46:34,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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) [2023-08-29 02:46:34,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-29 02:46:34,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-29 02:46:34,379 INFO L175 Difference]: Start difference. First operand has 56 places, 66 transitions, 150 flow. Second operand 3 states and 534 transitions. [2023-08-29 02:46:34,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 230 flow [2023-08-29 02:46:34,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:46:34,386 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 138 flow [2023-08-29 02:46:34,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-29 02:46:34,387 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2023-08-29 02:46:34,387 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 138 flow [2023-08-29 02:46:34,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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) [2023-08-29 02:46:34,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:34,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:34,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 02:46:34,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-08-29 02:46:34,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash 323335680, now seen corresponding path program 1 times [2023-08-29 02:46:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512210857] [2023-08-29 02:46:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:34,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512210857] [2023-08-29 02:46:34,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512210857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:34,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326684667] [2023-08-29 02:46:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:34,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:34,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:34,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:34,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 322 [2023-08-29 02:46:34,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2023-08-29 02:46:34,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:34,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 322 [2023-08-29 02:46:34,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:35,016 INFO L130 PetriNetUnfolder]: 5115/8604 cut-off events. [2023-08-29 02:46:35,018 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2023-08-29 02:46:35,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17091 conditions, 8604 events. 5115/8604 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 52040 event pairs, 1741 based on Foata normal form. 0/7461 useless extension candidates. Maximal degree in co-relation 17023. Up to 5196 conditions per place. [2023-08-29 02:46:35,053 INFO L137 encePairwiseOnDemand]: 310/322 looper letters, 74 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2023-08-29 02:46:35,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 388 flow [2023-08-29 02:46:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2023-08-29 02:46:35,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546583850931677 [2023-08-29 02:46:35,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2023-08-29 02:46:35,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2023-08-29 02:46:35,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:35,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2023-08-29 02:46:35,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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) [2023-08-29 02:46:35,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-29 02:46:35,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-29 02:46:35,061 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 138 flow. Second operand 3 states and 528 transitions. [2023-08-29 02:46:35,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 388 flow [2023-08-29 02:46:35,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:46:35,066 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 186 flow [2023-08-29 02:46:35,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-08-29 02:46:35,067 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-08-29 02:46:35,067 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 186 flow [2023-08-29 02:46:35,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2023-08-29 02:46:35,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:35,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:35,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 02:46:35,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-08-29 02:46:35,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash -26335446, now seen corresponding path program 1 times [2023-08-29 02:46:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834238534] [2023-08-29 02:46:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834238534] [2023-08-29 02:46:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834238534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:46:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199724757] [2023-08-29 02:46:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:35,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:35,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:46:35,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 02:46:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:35,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:46:35,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:46:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:46:35,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:46:35,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199724757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:35,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:46:35,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:46:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436823256] [2023-08-29 02:46:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:35,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:46:35,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 322 [2023-08-29 02:46:35,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-08-29 02:46:35,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:35,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 322 [2023-08-29 02:46:35,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:35,814 INFO L130 PetriNetUnfolder]: 4351/7685 cut-off events. [2023-08-29 02:46:35,814 INFO L131 PetriNetUnfolder]: For 1841/1869 co-relation queries the response was YES. [2023-08-29 02:46:35,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17054 conditions, 7685 events. 4351/7685 cut-off events. For 1841/1869 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 49151 event pairs, 3041 based on Foata normal form. 0/6658 useless extension candidates. Maximal degree in co-relation 6794. Up to 6349 conditions per place. [2023-08-29 02:46:35,840 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 56 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-08-29 02:46:35,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 358 flow [2023-08-29 02:46:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-08-29 02:46:35,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279503105590062 [2023-08-29 02:46:35,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-08-29 02:46:35,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-08-29 02:46:35,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:35,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-08-29 02:46:35,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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) [2023-08-29 02:46:35,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-29 02:46:35,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 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) [2023-08-29 02:46:35,845 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 186 flow. Second operand 3 states and 510 transitions. [2023-08-29 02:46:35,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 358 flow [2023-08-29 02:46:35,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 02:46:35,851 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 230 flow [2023-08-29 02:46:35,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2023-08-29 02:46:35,853 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-08-29 02:46:35,853 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 230 flow [2023-08-29 02:46:35,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-08-29 02:46:35,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:35,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:35,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-29 02:46:36,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:36,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-08-29 02:46:36,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:36,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1873726471, now seen corresponding path program 1 times [2023-08-29 02:46:36,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050732523] [2023-08-29 02:46:36,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050732523] [2023-08-29 02:46:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050732523] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:46:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61997107] [2023-08-29 02:46:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:36,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:36,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:46:36,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 02:46:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:36,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:46:36,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:46:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:36,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:46:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61997107] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:46:36,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:46:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:46:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309352840] [2023-08-29 02:46:36,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:46:36,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:46:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:36,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:46:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:46:36,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 322 [2023-08-29 02:46:36,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:46:36,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:36,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 322 [2023-08-29 02:46:36,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:36,314 INFO L130 PetriNetUnfolder]: 216/413 cut-off events. [2023-08-29 02:46:36,315 INFO L131 PetriNetUnfolder]: For 110/113 co-relation queries the response was YES. [2023-08-29 02:46:36,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 413 events. 216/413 cut-off events. For 110/113 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1801 event pairs, 59 based on Foata normal form. 59/441 useless extension candidates. Maximal degree in co-relation 906. Up to 266 conditions per place. [2023-08-29 02:46:36,316 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-29 02:46:36,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 191 flow [2023-08-29 02:46:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 02:46:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 02:46:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2023-08-29 02:46:36,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111801242236025 [2023-08-29 02:46:36,318 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2023-08-29 02:46:36,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2023-08-29 02:46:36,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:36,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2023-08-29 02:46:36,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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) [2023-08-29 02:46:36,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 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) [2023-08-29 02:46:36,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 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) [2023-08-29 02:46:36,322 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 230 flow. Second operand 5 states and 823 transitions. [2023-08-29 02:46:36,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 191 flow [2023-08-29 02:46:36,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 183 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-29 02:46:36,323 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-29 02:46:36,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-29 02:46:36,324 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -22 predicate places. [2023-08-29 02:46:36,324 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-29 02:46:36,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:46:36,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-08-29 02:46:36,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-08-29 02:46:36,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-29 02:46:36,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:36,530 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-29 02:46:36,531 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:46:36,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:36,553 INFO L130 PetriNetUnfolder]: 43/397 cut-off events. [2023-08-29 02:46:36,554 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:46:36,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 397 events. 43/397 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1546 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 253. Up to 9 conditions per place. [2023-08-29 02:46:36,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:36,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:36,556 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:36,556 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:36,557 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:36,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 183 transitions, 384 flow [2023-08-29 02:46:36,578 INFO L130 PetriNetUnfolder]: 43/397 cut-off events. [2023-08-29 02:46:36,578 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:46:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 397 events. 43/397 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1546 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 253. Up to 9 conditions per place. [2023-08-29 02:46:36,584 INFO L119 LiptonReduction]: Number of co-enabled transitions 10076 [2023-08-29 02:46:39,294 INFO L134 LiptonReduction]: Checked pairs total: 24563 [2023-08-29 02:46:39,294 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-29 02:46:39,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:46:39,296 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:39,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:46:39,299 INFO L130 PetriNetUnfolder]: 14/74 cut-off events. [2023-08-29 02:46:39,299 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 02:46:39,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:39,299 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 02:46:39,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:46:39,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1835437484, now seen corresponding path program 1 times [2023-08-29 02:46:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312595717] [2023-08-29 02:46:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:46:39,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:46:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:46:39,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:46:39,339 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:46:39,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:46:39,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 02:46:39,340 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:46:39,340 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:46:39,340 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:46:39,340 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 02:46:39,358 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 02:46:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:39,394 INFO L130 PetriNetUnfolder]: 65/586 cut-off events. [2023-08-29 02:46:39,394 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:46:39,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 586 events. 65/586 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2585 event pairs, 1 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 405. Up to 16 conditions per place. [2023-08-29 02:46:39,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:39,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:39,399 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:39,399 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:39,399 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:39,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:39,430 INFO L130 PetriNetUnfolder]: 65/586 cut-off events. [2023-08-29 02:46:39,430 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:46:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 586 events. 65/586 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2585 event pairs, 1 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 405. Up to 16 conditions per place. [2023-08-29 02:46:39,443 INFO L119 LiptonReduction]: Number of co-enabled transitions 16764 [2023-08-29 02:46:41,866 INFO L134 LiptonReduction]: Checked pairs total: 44340 [2023-08-29 02:46:41,867 INFO L136 LiptonReduction]: Total number of compositions: 156 [2023-08-29 02:46:41,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:46:41,872 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:41,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-29 02:46:41,874 INFO L130 PetriNetUnfolder]: 2/10 cut-off events. [2023-08-29 02:46:41,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:46:41,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:41,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:46:41,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:46:41,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 48091979, now seen corresponding path program 1 times [2023-08-29 02:46:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:41,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462195922] [2023-08-29 02:46:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462195922] [2023-08-29 02:46:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462195922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623191934] [2023-08-29 02:46:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:41,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:41,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 363 [2023-08-29 02:46:41,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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) [2023-08-29 02:46:41,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:41,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 363 [2023-08-29 02:46:41,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:43,070 INFO L130 PetriNetUnfolder]: 13695/21841 cut-off events. [2023-08-29 02:46:43,070 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2023-08-29 02:46:43,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41666 conditions, 21841 events. 13695/21841 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 157390 event pairs, 8471 based on Foata normal form. 3807/22940 useless extension candidates. Maximal degree in co-relation 5206. Up to 19416 conditions per place. [2023-08-29 02:46:43,141 INFO L137 encePairwiseOnDemand]: 345/363 looper letters, 48 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-29 02:46:43,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 272 flow [2023-08-29 02:46:43,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2023-08-29 02:46:43,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482093663911846 [2023-08-29 02:46:43,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2023-08-29 02:46:43,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2023-08-29 02:46:43,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:43,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2023-08-29 02:46:43,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 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) [2023-08-29 02:46:43,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 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) [2023-08-29 02:46:43,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 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) [2023-08-29 02:46:43,147 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 190 flow. Second operand 3 states and 597 transitions. [2023-08-29 02:46:43,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 272 flow [2023-08-29 02:46:43,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:46:43,148 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 170 flow [2023-08-29 02:46:43,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-08-29 02:46:43,149 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2023-08-29 02:46:43,149 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 170 flow [2023-08-29 02:46:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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) [2023-08-29 02:46:43,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:43,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:43,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 02:46:43,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:46:43,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1748454599, now seen corresponding path program 1 times [2023-08-29 02:46:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690818915] [2023-08-29 02:46:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690818915] [2023-08-29 02:46:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690818915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:43,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:43,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630211052] [2023-08-29 02:46:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:43,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 363 [2023-08-29 02:46:43,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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) [2023-08-29 02:46:43,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:43,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 363 [2023-08-29 02:46:43,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:47,243 INFO L130 PetriNetUnfolder]: 51390/75624 cut-off events. [2023-08-29 02:46:47,244 INFO L131 PetriNetUnfolder]: For 1994/1994 co-relation queries the response was YES. [2023-08-29 02:46:47,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150472 conditions, 75624 events. 51390/75624 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 522813 event pairs, 20510 based on Foata normal form. 0/66439 useless extension candidates. Maximal degree in co-relation 150414. Up to 48698 conditions per place. [2023-08-29 02:46:47,514 INFO L137 encePairwiseOnDemand]: 348/363 looper letters, 85 selfloop transitions, 10 changer transitions 1/105 dead transitions. [2023-08-29 02:46:47,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 468 flow [2023-08-29 02:46:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2023-08-29 02:46:47,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390266299357208 [2023-08-29 02:46:47,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2023-08-29 02:46:47,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2023-08-29 02:46:47,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:47,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2023-08-29 02:46:47,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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) [2023-08-29 02:46:47,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 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) [2023-08-29 02:46:47,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 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) [2023-08-29 02:46:47,520 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 170 flow. Second operand 3 states and 587 transitions. [2023-08-29 02:46:47,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 468 flow [2023-08-29 02:46:47,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:46:47,529 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 234 flow [2023-08-29 02:46:47,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2023-08-29 02:46:47,530 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2023-08-29 02:46:47,530 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 234 flow [2023-08-29 02:46:47,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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) [2023-08-29 02:46:47,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:47,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:47,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 02:46:47,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:46:47,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1514494935, now seen corresponding path program 1 times [2023-08-29 02:46:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547884282] [2023-08-29 02:46:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:47,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547884282] [2023-08-29 02:46:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547884282] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:46:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174626698] [2023-08-29 02:46:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:47,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:47,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:47,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:46:47,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 02:46:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:47,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:46:47,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:46:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:46:47,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:46:47,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174626698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:47,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:46:47,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:46:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908281006] [2023-08-29 02:46:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:47,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:47,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:46:47,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 363 [2023-08-29 02:46:47,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-08-29 02:46:47,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:47,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 363 [2023-08-29 02:46:47,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:51,418 INFO L130 PetriNetUnfolder]: 42539/65299 cut-off events. [2023-08-29 02:46:51,418 INFO L131 PetriNetUnfolder]: For 19193/19205 co-relation queries the response was YES. [2023-08-29 02:46:51,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147349 conditions, 65299 events. 42539/65299 cut-off events. For 19193/19205 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 492730 event pairs, 29553 based on Foata normal form. 4/56671 useless extension candidates. Maximal degree in co-relation 33433. Up to 54851 conditions per place. [2023-08-29 02:46:51,685 INFO L137 encePairwiseOnDemand]: 356/363 looper letters, 64 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2023-08-29 02:46:51,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 440 flow [2023-08-29 02:46:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:46:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:46:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2023-08-29 02:46:51,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224977043158862 [2023-08-29 02:46:51,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2023-08-29 02:46:51,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2023-08-29 02:46:51,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:51,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2023-08-29 02:46:51,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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) [2023-08-29 02:46:51,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 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) [2023-08-29 02:46:51,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 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) [2023-08-29 02:46:51,690 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 234 flow. Second operand 3 states and 569 transitions. [2023-08-29 02:46:51,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 440 flow [2023-08-29 02:46:51,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 412 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 02:46:51,718 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 294 flow [2023-08-29 02:46:51,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-08-29 02:46:51,719 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2023-08-29 02:46:51,719 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 294 flow [2023-08-29 02:46:51,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-08-29 02:46:51,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:51,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:46:51,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-29 02:46:51,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-29 02:46:51,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:46:51,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 573810228, now seen corresponding path program 1 times [2023-08-29 02:46:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778110834] [2023-08-29 02:46:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:51,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778110834] [2023-08-29 02:46:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778110834] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:46:51,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753152175] [2023-08-29 02:46:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:51,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:51,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:46:51,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:46:51,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 02:46:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:52,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:46:52,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:46:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:52,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:46:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:52,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753152175] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:46:52,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:46:52,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:46:52,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579587267] [2023-08-29 02:46:52,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:46:52,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:46:52,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:52,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:46:52,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:46:52,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 363 [2023-08-29 02:46:52,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 178.14285714285714) internal successors, (1247), 7 states have internal predecessors, (1247), 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) [2023-08-29 02:46:52,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:52,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 363 [2023-08-29 02:46:52,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:46:52,459 INFO L130 PetriNetUnfolder]: 2472/3814 cut-off events. [2023-08-29 02:46:52,459 INFO L131 PetriNetUnfolder]: For 2106/2106 co-relation queries the response was YES. [2023-08-29 02:46:52,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 3814 events. 2472/3814 cut-off events. For 2106/2106 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21107 event pairs, 74 based on Foata normal form. 393/3902 useless extension candidates. Maximal degree in co-relation 9140. Up to 2433 conditions per place. [2023-08-29 02:46:52,465 INFO L137 encePairwiseOnDemand]: 360/363 looper letters, 0 selfloop transitions, 0 changer transitions 73/73 dead transitions. [2023-08-29 02:46:52,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 374 flow [2023-08-29 02:46:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:46:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:46:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1111 transitions. [2023-08-29 02:46:52,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2023-08-29 02:46:52,472 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1111 transitions. [2023-08-29 02:46:52,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1111 transitions. [2023-08-29 02:46:52,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:46:52,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1111 transitions. [2023-08-29 02:46:52,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:46:52,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 363.0) internal successors, (2541), 7 states have internal predecessors, (2541), 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) [2023-08-29 02:46:52,480 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 363.0) internal successors, (2541), 7 states have internal predecessors, (2541), 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) [2023-08-29 02:46:52,480 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 294 flow. Second operand 6 states and 1111 transitions. [2023-08-29 02:46:52,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 374 flow [2023-08-29 02:46:52,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 338 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-29 02:46:52,482 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-29 02:46:52,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-08-29 02:46:52,483 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -23 predicate places. [2023-08-29 02:46:52,483 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-29 02:46:52,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 178.14285714285714) internal successors, (1247), 7 states have internal predecessors, (1247), 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) [2023-08-29 02:46:52,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2023-08-29 02:46:52,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-08-29 02:46:52,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-08-29 02:46:52,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-08-29 02:46:52,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-08-29 02:46:52,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-08-29 02:46:52,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-08-29 02:46:52,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-08-29 02:46:52,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-08-29 02:46:52,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-29 02:46:52,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:46:52,690 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-29 02:46:52,691 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:46:52,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:52,726 INFO L130 PetriNetUnfolder]: 65/586 cut-off events. [2023-08-29 02:46:52,726 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:46:52,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 586 events. 65/586 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2585 event pairs, 1 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 405. Up to 16 conditions per place. [2023-08-29 02:46:52,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:52,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:52,731 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:52,731 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:52,731 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:52,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 207 transitions, 444 flow [2023-08-29 02:46:52,768 INFO L130 PetriNetUnfolder]: 65/586 cut-off events. [2023-08-29 02:46:52,768 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:46:52,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 586 events. 65/586 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2585 event pairs, 1 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 405. Up to 16 conditions per place. [2023-08-29 02:46:52,776 INFO L119 LiptonReduction]: Number of co-enabled transitions 16764 [2023-08-29 02:46:55,592 INFO L134 LiptonReduction]: Checked pairs total: 39936 [2023-08-29 02:46:55,592 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-29 02:46:55,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:46:55,593 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:55,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:46:55,600 INFO L130 PetriNetUnfolder]: 28/135 cut-off events. [2023-08-29 02:46:55,601 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 02:46:55,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:55,601 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 02:46:55,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:46:55,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1393653757, now seen corresponding path program 1 times [2023-08-29 02:46:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608921939] [2023-08-29 02:46:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:46:55,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:46:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:46:55,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:46:55,627 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:46:55,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:46:55,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 02:46:55,628 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:46:55,629 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:46:55,629 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:46:55,630 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 02:46:55,643 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 02:46:55,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 231 transitions, 506 flow [2023-08-29 02:46:55,700 INFO L130 PetriNetUnfolder]: 99/863 cut-off events. [2023-08-29 02:46:55,701 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:46:55,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 863 events. 99/863 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4153 event pairs, 6 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 606. Up to 32 conditions per place. [2023-08-29 02:46:55,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 231 transitions, 506 flow [2023-08-29 02:46:55,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 231 transitions, 506 flow [2023-08-29 02:46:55,709 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:46:55,709 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 231 transitions, 506 flow [2023-08-29 02:46:55,710 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 231 transitions, 506 flow [2023-08-29 02:46:55,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 231 transitions, 506 flow [2023-08-29 02:46:55,849 INFO L130 PetriNetUnfolder]: 99/863 cut-off events. [2023-08-29 02:46:55,849 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:46:55,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 863 events. 99/863 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4153 event pairs, 6 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 606. Up to 32 conditions per place. [2023-08-29 02:46:55,859 INFO L119 LiptonReduction]: Number of co-enabled transitions 24552 [2023-08-29 02:46:58,631 INFO L134 LiptonReduction]: Checked pairs total: 58735 [2023-08-29 02:46:58,631 INFO L136 LiptonReduction]: Total number of compositions: 173 [2023-08-29 02:46:58,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:46:58,633 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:46:58,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 02:46:58,634 INFO L130 PetriNetUnfolder]: 2/8 cut-off events. [2023-08-29 02:46:58,634 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:46:58,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:46:58,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:46:58,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-08-29 02:46:58,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:46:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 66096459, now seen corresponding path program 1 times [2023-08-29 02:46:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:46:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160111007] [2023-08-29 02:46:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:46:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:46:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:46:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:46:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:46:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160111007] [2023-08-29 02:46:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160111007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:46:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:46:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:46:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274793566] [2023-08-29 02:46:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:46:58,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:46:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:46:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:46:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:46:58,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 404 [2023-08-29 02:46:58,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 94 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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) [2023-08-29 02:46:58,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:46:58,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 404 [2023-08-29 02:46:58,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:47:09,387 INFO L130 PetriNetUnfolder]: 116214/166699 cut-off events. [2023-08-29 02:47:09,388 INFO L131 PetriNetUnfolder]: For 6423/6423 co-relation queries the response was YES. [2023-08-29 02:47:09,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323222 conditions, 166699 events. 116214/166699 cut-off events. For 6423/6423 co-relation queries the response was YES. Maximal size of possible extension queue 4013. Compared 1290030 event pairs, 81892 based on Foata normal form. 30361/178790 useless extension candidates. Maximal degree in co-relation 42294. Up to 152867 conditions per place. [2023-08-29 02:47:10,162 INFO L137 encePairwiseOnDemand]: 383/404 looper letters, 56 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-08-29 02:47:10,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 324 flow [2023-08-29 02:47:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:47:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:47:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2023-08-29 02:47:10,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462046204620462 [2023-08-29 02:47:10,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 662 transitions. [2023-08-29 02:47:10,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 662 transitions. [2023-08-29 02:47:10,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:47:10,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 662 transitions. [2023-08-29 02:47:10,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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) [2023-08-29 02:47:10,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 404.0) internal successors, (1616), 4 states have internal predecessors, (1616), 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) [2023-08-29 02:47:10,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 404.0) internal successors, (1616), 4 states have internal predecessors, (1616), 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) [2023-08-29 02:47:10,171 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 232 flow. Second operand 3 states and 662 transitions. [2023-08-29 02:47:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 324 flow [2023-08-29 02:47:10,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:47:10,174 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 204 flow [2023-08-29 02:47:10,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=404, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2023-08-29 02:47:10,175 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2023-08-29 02:47:10,175 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 204 flow [2023-08-29 02:47:10,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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) [2023-08-29 02:47:10,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:47:10,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:47:10,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 02:47:10,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-08-29 02:47:10,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:47:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2055694603, now seen corresponding path program 1 times [2023-08-29 02:47:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:47:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784940072] [2023-08-29 02:47:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:47:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:47:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:47:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:47:10,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:47:10,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784940072] [2023-08-29 02:47:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784940072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:47:10,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:47:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:47:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256300316] [2023-08-29 02:47:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:47:10,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:47:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:47:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:47:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:47:10,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 404 [2023-08-29 02:47:10,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-08-29 02:47:10,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:47:10,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 404 [2023-08-29 02:47:10,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:47:52,480 INFO L130 PetriNetUnfolder]: 572914/775724 cut-off events. [2023-08-29 02:47:52,481 INFO L131 PetriNetUnfolder]: For 21045/21045 co-relation queries the response was YES. [2023-08-29 02:47:53,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547358 conditions, 775724 events. 572914/775724 cut-off events. For 21045/21045 co-relation queries the response was YES. Maximal size of possible extension queue 10451. Compared 5770848 event pairs, 254782 based on Foata normal form. 0/687345 useless extension candidates. Maximal degree in co-relation 1547293. Up to 507448 conditions per place. [2023-08-29 02:47:56,214 INFO L137 encePairwiseOnDemand]: 386/404 looper letters, 100 selfloop transitions, 12 changer transitions 1/123 dead transitions. [2023-08-29 02:47:56,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 564 flow [2023-08-29 02:47:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:47:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:47:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2023-08-29 02:47:56,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363036303630363 [2023-08-29 02:47:56,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2023-08-29 02:47:56,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2023-08-29 02:47:56,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:47:56,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2023-08-29 02:47:56,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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) [2023-08-29 02:47:56,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 404.0) internal successors, (1616), 4 states have internal predecessors, (1616), 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) [2023-08-29 02:47:56,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 404.0) internal successors, (1616), 4 states have internal predecessors, (1616), 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) [2023-08-29 02:47:56,219 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 204 flow. Second operand 3 states and 650 transitions. [2023-08-29 02:47:56,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 564 flow [2023-08-29 02:47:56,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:47:56,240 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 284 flow [2023-08-29 02:47:56,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=404, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2023-08-29 02:47:56,241 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2023-08-29 02:47:56,241 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 284 flow [2023-08-29 02:47:56,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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) [2023-08-29 02:47:56,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:47:56,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:47:56,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 02:47:56,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-08-29 02:47:56,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:47:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1448716861, now seen corresponding path program 1 times [2023-08-29 02:47:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:47:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498974101] [2023-08-29 02:47:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:47:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:47:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:47:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:47:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:47:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498974101] [2023-08-29 02:47:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498974101] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:47:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300148438] [2023-08-29 02:47:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:47:56,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:47:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:47:56,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:47:56,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 02:47:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:47:56,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:47:56,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:47:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:47:56,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:47:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300148438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:47:56,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:47:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:47:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701105594] [2023-08-29 02:47:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:47:56,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:47:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:47:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:47:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:47:56,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 404 [2023-08-29 02:47:56,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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) [2023-08-29 02:47:56,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:47:56,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 404 [2023-08-29 02:47:56,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:48:09,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 95#L715-4true, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 49#L715-3true, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:09,145 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,145 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,145 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,145 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 132#L715-3true, 87#L709-17true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 180#L715-7true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:09,146 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,146 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,146 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,146 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 49#L715-3true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:09,147 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 132#L715-3true, 104#L709-27true, 190#L715-3true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:09,147 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:09,147 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,039 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 102#L715-3true, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:10,039 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,039 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,039 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,039 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,040 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, 102#L715-3true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:10,040 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,040 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,040 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:10,040 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:48:11,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 87#L709-17true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:11,363 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,363 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,363 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,363 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:11,364 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,364 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,364 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,364 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,373 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 87#L709-17true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 180#L715-7true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:11,374 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,374 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,374 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,374 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, 95#L715-4true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:11,375 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,375 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,375 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,376 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:11,705 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,712 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,713 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,713 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,713 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:11,713 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,714 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,714 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:11,714 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:48:12,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:12,697 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,697 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,697 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,697 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,697 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:12,698 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,698 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,698 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,698 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [30#L692-2true, Black: 221#true, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:12,813 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,813 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,813 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,813 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,814 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [30#L692-2true, Black: 221#true, 104#L709-27true, 190#L715-3true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:12,814 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,814 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,814 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:12,814 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:48:13,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 170#L715-6true, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:13,991 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,991 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,991 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,991 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 170#L715-6true, 104#L709-27true, 190#L715-3true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:13,991 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,991 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,992 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:48:13,992 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:48:15,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 87#L709-17true, t_funThread1of4ForFork0InUse, 183#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 180#L715-7true, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:15,590 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,590 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,590 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1955] L715-1-->L715-3: Formula: (= |v_#race~glob~0_113| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_113|, t_funThread4of4ForFork0_#t~nondet14#1=|v_t_funThread4of4ForFork0_#t~nondet14#1_7|} AuxVars[] AssignedVars[#race~glob~0, t_funThread4of4ForFork0_#t~nondet14#1][76], [Black: 221#true, 104#L709-27true, 190#L715-3true, t_funThread1of4ForFork0InUse, 183#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:15,591 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:15,591 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:21,001 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1959] L709-15-->L709-17: Formula: (= |v_#race~glob~0_115| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_115|, ULTIMATE.start_bar_#t~nondet10#1=|v_ULTIMATE.start_bar_#t~nondet10#1_67|} AuxVars[] AssignedVars[#race~glob~0, ULTIMATE.start_bar_#t~nondet10#1][74], [Black: 221#true, 111#t_funEXITtrue, 102#L715-3true, 53#L715-4true, 87#L709-17true, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 194#L715-4true, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:21,002 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:48:21,002 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:48:21,003 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:48:21,003 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:48:28,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 54#L709-25true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:28,765 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,765 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,766 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,766 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 54#L709-25true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:28,766 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,766 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,766 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,766 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,987 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 54#L709-25true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:28,987 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,987 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,987 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:28,987 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:29,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 54#L709-25true, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:29,025 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:48:29,025 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:29,026 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:29,026 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:48:30,204 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 97#L709-28true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:30,205 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [Black: 221#true, 30#L692-2true, 97#L709-28true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:30,206 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,206 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,755 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 97#L709-28true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:30,756 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,756 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,756 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,756 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,787 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 97#L709-28true, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:30,788 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,788 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,788 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:30,788 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:48:31,767 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 150#L699-6true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:31,767 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 150#L699-6true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:31,768 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,768 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 150#L699-6true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:31,964 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,964 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,965 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,965 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,988 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 150#L699-6true, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:31,988 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,988 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,989 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:31,989 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:48:32,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 68#L709-29true]) [2023-08-29 02:48:32,283 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 68#L709-29true]) [2023-08-29 02:48:32,284 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,284 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:32,480 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,480 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,480 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,481 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:32,481 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,481 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,481 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,481 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,994 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 68#L709-29true]) [2023-08-29 02:48:32,994 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,994 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,995 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:32,995 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,002 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 68#L709-29true, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:33,002 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,002 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,002 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,002 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,063 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:33,063 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,063 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,063 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,063 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:33,072 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,072 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,072 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,072 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:48:33,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:33,556 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,556 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,556 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,556 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:33,556 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,556 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,556 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,557 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,575 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 108#ULTIMATE.startEXITtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:33,575 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,575 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,575 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,575 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 108#ULTIMATE.startEXITtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:33,576 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,576 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,576 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:33,576 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,047 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:34,048 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,048 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,048 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,048 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:34,066 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,066 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,066 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,067 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,080 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 108#ULTIMATE.startEXITtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,080 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,080 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,080 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,080 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,087 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 108#ULTIMATE.startEXITtrue, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,087 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,087 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,087 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,087 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:48:34,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1692] L709-2-->L709-3: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][37], [Black: 221#true, 83#L709-3true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 95#L715-4true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,343 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,343 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,343 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,344 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,344 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, 5#L709-2true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,344 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,344 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,344 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,344 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,357 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [30#L692-2true, Black: 221#true, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, 5#L709-2true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,360 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,361 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,361 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,361 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, 90#L692true, t_funThread4of4ForFork0NotInUse, 47#L722-9true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,587 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [t_funThread1of4ForFork0InUse, 30#L692-2true, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 47#L722-9true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,588 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,588 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,588 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,588 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,727 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1692] L709-2-->L709-3: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][37], [Black: 221#true, 83#L709-3true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, 194#L715-4true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,727 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,727 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,727 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,727 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,728 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [Black: 221#true, 205#L692-1true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 5#L709-2true, 57#t_funEXITtrue, t_funThread1of4ForFork0InUse, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,728 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,728 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,728 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,728 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1692] L709-2-->L709-3: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][37], [Black: 221#true, 83#L709-3true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 64#L715-4true, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,742 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [Black: 221#true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 5#L709-2true, t_funThread1of4ForFork0InUse, 57#t_funEXITtrue, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0InUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,743 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 205#L692-1true, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 47#L722-9true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:34,997 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,997 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,997 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:34,997 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:35,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 47#L722-9true, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:35,013 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:48:35,013 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:35,013 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:35,013 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:48:36,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 90#L692true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:36,051 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,052 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [t_funThread1of4ForFork0InUse, 30#L692-2true, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:36,052 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:36,053 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 205#L692-1true, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:36,187 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,187 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:36,187 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,187 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 121#L722-13true]) [2023-08-29 02:48:36,200 INFO L383 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,200 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,200 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:48:36,200 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-29 02:48:36,428 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 90#L692true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:36,429 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,429 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,429 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,429 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [t_funThread1of4ForFork0InUse, 30#L692-2true, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:36,429 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,429 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,429 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,430 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,435 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2002] L715-4-->L692: Formula: (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_176 0) 1 0)) InVars {~glob~0=v_~glob~0_176} OutVars{~glob~0=v_~glob~0_176, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_15|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][15], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 90#L692true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 108#ULTIMATE.startEXITtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:36,436 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,436 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2059] L715-4-->L692-2: Formula: (and (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19| 0) (= |v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13| (ite (= v_~glob~0_184 0) 1 0))) InVars {~glob~0=v_~glob~0_184} OutVars{~glob~0=v_~glob~0_184, t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1_13|, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of4ForFork0___VERIFIER_assert_~cond#1][16], [t_funThread1of4ForFork0InUse, Black: 221#true, 30#L692-2true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 108#ULTIMATE.startEXITtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:36,436 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,437 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,497 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, 205#L692-1true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:36,497 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,497 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,498 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,498 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,500 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0), 23#L722-8true]) [2023-08-29 02:48:36,500 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,500 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,501 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,501 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,503 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2054] L715-4-->L692-1: Formula: (and (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| (ite (= v_~glob~0_182 0) 1 0)) (= |v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9| |v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|)) InVars {~glob~0=v_~glob~0_182} OutVars{t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1_9|, ~glob~0=v_~glob~0_182, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread2of4ForFork0___VERIFIER_assert_~cond#1_19|} AuxVars[] AssignedVars[t_funThread2of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread2of4ForFork0___VERIFIER_assert_~cond#1][32], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, 205#L692-1true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 108#ULTIMATE.startEXITtrue, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 173#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:36,503 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,503 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,504 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,504 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2040] L715-4-->L692-1: Formula: (and (= |v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17| |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|) (= (ite (= v_~glob~0_180 0) 1 0) |v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|)) InVars {~glob~0=v_~glob~0_180} OutVars{~glob~0=v_~glob~0_180, t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1_9|, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread3of4ForFork0___VERIFIER_assert_~cond#1_17|} AuxVars[] AssignedVars[t_funThread3of4ForFork0___VERIFIER_assert_#in~cond#1, t_funThread3of4ForFork0___VERIFIER_assert_~cond#1][48], [t_funThread1of4ForFork0InUse, Black: 221#true, t_funThread2of4ForFork0InUse, 227#true, t_funThread3of4ForFork0InUse, t_funThread4of4ForFork0NotInUse, 165#L692-1true, 21#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 36#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 108#ULTIMATE.startEXITtrue, Black: 218#(= |ULTIMATE.start_main_~i~1#1| 0), 223#(= |#race~glob~0| 0)]) [2023-08-29 02:48:36,505 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,506 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:36,506 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:48:36,506 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:48:37,626 INFO L130 PetriNetUnfolder]: 439672/623591 cut-off events. [2023-08-29 02:48:37,626 INFO L131 PetriNetUnfolder]: For 211004/211620 co-relation queries the response was YES. [2023-08-29 02:48:39,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423211 conditions, 623591 events. 439672/623591 cut-off events. For 211004/211620 co-relation queries the response was YES. Maximal size of possible extension queue 10806. Compared 5236187 event pairs, 335322 based on Foata normal form. 391/545644 useless extension candidates. Maximal degree in co-relation 269665. Up to 556044 conditions per place. [2023-08-29 02:48:41,397 INFO L137 encePairwiseOnDemand]: 397/404 looper letters, 75 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2023-08-29 02:48:41,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 108 transitions, 530 flow [2023-08-29 02:48:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:48:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:48:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-29 02:48:41,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198019801980198 [2023-08-29 02:48:41,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-29 02:48:41,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-29 02:48:41,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:48:41,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-29 02:48:41,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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) [2023-08-29 02:48:41,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 404.0) internal successors, (1616), 4 states have internal predecessors, (1616), 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) [2023-08-29 02:48:41,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 404.0) internal successors, (1616), 4 states have internal predecessors, (1616), 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) [2023-08-29 02:48:41,403 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 284 flow. Second operand 3 states and 630 transitions. [2023-08-29 02:48:41,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 108 transitions, 530 flow [2023-08-29 02:48:43,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 496 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 02:48:43,702 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 342 flow [2023-08-29 02:48:43,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=404, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2023-08-29 02:48:43,703 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2023-08-29 02:48:43,703 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 342 flow [2023-08-29 02:48:43,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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) [2023-08-29 02:48:43,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:48:43,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:48:43,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-29 02:48:43,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:48:43,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-08-29 02:48:43,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:48:43,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1747069369, now seen corresponding path program 1 times [2023-08-29 02:48:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:48:43,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870358201] [2023-08-29 02:48:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:48:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:48:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:48:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:48:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:48:43,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870358201] [2023-08-29 02:48:43,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870358201] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:48:43,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140814804] [2023-08-29 02:48:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:48:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:48:43,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:48:43,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:48:43,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 02:48:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:48:44,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:48:44,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:48:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:48:44,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:48:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:48:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140814804] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:48:44,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:48:44,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:48:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409020309] [2023-08-29 02:48:44,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:48:44,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:48:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:48:44,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:48:44,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:48:44,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 404 [2023-08-29 02:48:44,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 196.14285714285714) internal successors, (1373), 7 states have internal predecessors, (1373), 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) [2023-08-29 02:48:44,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:48:44,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 404 [2023-08-29 02:48:44,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:49:19,217 INFO L130 PetriNetUnfolder]: 391307/560220 cut-off events. [2023-08-29 02:49:19,217 INFO L131 PetriNetUnfolder]: For 274732/280853 co-relation queries the response was YES. [2023-08-29 02:49:20,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320308 conditions, 560220 events. 391307/560220 cut-off events. For 274732/280853 co-relation queries the response was YES. Maximal size of possible extension queue 10734. Compared 4691585 event pairs, 57084 based on Foata normal form. 395/486431 useless extension candidates. Maximal degree in co-relation 344348. Up to 476397 conditions per place. [2023-08-29 02:49:22,845 INFO L137 encePairwiseOnDemand]: 400/404 looper letters, 128 selfloop transitions, 6 changer transitions 0/160 dead transitions. [2023-08-29 02:49:22,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 160 transitions, 828 flow [2023-08-29 02:49:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:49:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:49:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1272 transitions. [2023-08-29 02:49:22,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247524752475248 [2023-08-29 02:49:22,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1272 transitions. [2023-08-29 02:49:22,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1272 transitions. [2023-08-29 02:49:22,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:49:22,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1272 transitions. [2023-08-29 02:49:22,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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) [2023-08-29 02:49:22,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 404.0) internal successors, (2828), 7 states have internal predecessors, (2828), 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) [2023-08-29 02:49:22,870 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 404.0) internal successors, (2828), 7 states have internal predecessors, (2828), 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) [2023-08-29 02:49:22,884 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 342 flow. Second operand 6 states and 1272 transitions. [2023-08-29 02:49:22,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 160 transitions, 828 flow [2023-08-29 02:49:24,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:49:24,337 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 372 flow [2023-08-29 02:49:24,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=404, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2023-08-29 02:49:24,338 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2023-08-29 02:49:24,338 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 372 flow [2023-08-29 02:49:24,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.14285714285714) internal successors, (1373), 7 states have internal predecessors, (1373), 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) [2023-08-29 02:49:24,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:24,338 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:49:24,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-29 02:49:24,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:49:24,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-08-29 02:49:24,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1811105756, now seen corresponding path program 1 times [2023-08-29 02:49:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853290985] [2023-08-29 02:49:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:49:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:49:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853290985] [2023-08-29 02:49:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853290985] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:49:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521354805] [2023-08-29 02:49:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:49:24,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:49:24,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:49:24,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 02:49:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:24,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 02:49:24,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:49:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:49:24,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:49:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:49:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521354805] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:49:24,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:49:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 02:49:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788197324] [2023-08-29 02:49:24,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:49:24,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 02:49:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:49:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 02:49:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 02:49:25,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 404 [2023-08-29 02:49:25,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 372 flow. Second operand has 13 states, 13 states have (on average 196.23076923076923) internal successors, (2551), 13 states have internal predecessors, (2551), 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) [2023-08-29 02:49:25,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:49:25,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 404 [2023-08-29 02:49:25,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:49:27,300 INFO L130 PetriNetUnfolder]: 24371/34229 cut-off events. [2023-08-29 02:49:27,300 INFO L131 PetriNetUnfolder]: For 39456/39456 co-relation queries the response was YES. [2023-08-29 02:49:27,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93436 conditions, 34229 events. 24371/34229 cut-off events. For 39456/39456 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 217083 event pairs, 935 based on Foata normal form. 2461/34454 useless extension candidates. Maximal degree in co-relation 10308. Up to 20974 conditions per place. [2023-08-29 02:49:27,395 INFO L137 encePairwiseOnDemand]: 401/404 looper letters, 0 selfloop transitions, 0 changer transitions 111/111 dead transitions. [2023-08-29 02:49:27,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 605 flow [2023-08-29 02:49:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 02:49:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 02:49:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1441 transitions. [2023-08-29 02:49:27,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095473833097596 [2023-08-29 02:49:27,420 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1441 transitions. [2023-08-29 02:49:27,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1441 transitions. [2023-08-29 02:49:27,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:49:27,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1441 transitions. [2023-08-29 02:49:27,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 205.85714285714286) internal successors, (1441), 7 states have internal predecessors, (1441), 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) [2023-08-29 02:49:27,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 404.0) internal successors, (3232), 8 states have internal predecessors, (3232), 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) [2023-08-29 02:49:27,428 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 404.0) internal successors, (3232), 8 states have internal predecessors, (3232), 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) [2023-08-29 02:49:27,428 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 372 flow. Second operand 7 states and 1441 transitions. [2023-08-29 02:49:27,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 605 flow [2023-08-29 02:49:27,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 528 flow, removed 33 selfloop flow, removed 6 redundant places. [2023-08-29 02:49:27,458 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2023-08-29 02:49:27,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=404, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2023-08-29 02:49:27,458 INFO L281 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2023-08-29 02:49:27,459 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 0 transitions, 0 flow [2023-08-29 02:49:27,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 196.23076923076923) internal successors, (2551), 13 states have internal predecessors, (2551), 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) [2023-08-29 02:49:27,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2023-08-29 02:49:27,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-08-29 02:49:27,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-08-29 02:49:27,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-08-29 02:49:27,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-08-29 02:49:27,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-08-29 02:49:27,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-08-29 02:49:27,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-08-29 02:49:27,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-08-29 02:49:27,461 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-08-29 02:49:27,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-29 02:49:27,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:49:27,668 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-29 02:49:27,669 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:49:27,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 231 transitions, 506 flow [2023-08-29 02:49:27,719 INFO L130 PetriNetUnfolder]: 99/863 cut-off events. [2023-08-29 02:49:27,719 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:49:27,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 863 events. 99/863 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4153 event pairs, 6 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 606. Up to 32 conditions per place. [2023-08-29 02:49:27,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 231 transitions, 506 flow [2023-08-29 02:49:27,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 231 transitions, 506 flow [2023-08-29 02:49:27,725 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:49:27,725 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 231 transitions, 506 flow [2023-08-29 02:49:27,726 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 231 transitions, 506 flow [2023-08-29 02:49:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 231 transitions, 506 flow [2023-08-29 02:49:27,775 INFO L130 PetriNetUnfolder]: 99/863 cut-off events. [2023-08-29 02:49:27,775 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:49:27,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 863 events. 99/863 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4153 event pairs, 6 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 606. Up to 32 conditions per place. [2023-08-29 02:49:27,788 INFO L119 LiptonReduction]: Number of co-enabled transitions 24552 [2023-08-29 02:49:31,202 INFO L134 LiptonReduction]: Checked pairs total: 57823 [2023-08-29 02:49:31,203 INFO L136 LiptonReduction]: Total number of compositions: 175 [2023-08-29 02:49:31,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:49:31,204 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:49:31,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:49:31,210 INFO L130 PetriNetUnfolder]: 38/186 cut-off events. [2023-08-29 02:49:31,210 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-29 02:49:31,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:31,211 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-29 02:49:31,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:49:31,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -941513639, now seen corresponding path program 1 times [2023-08-29 02:49:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819624202] [2023-08-29 02:49:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:49:31,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:49:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:49:31,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:49:31,241 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:49:31,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:49:31,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 02:49:31,242 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:49:31,243 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:49:31,243 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:49:31,243 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-08-29 02:49:31,264 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-08-29 02:49:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 255 transitions, 570 flow [2023-08-29 02:49:31,359 INFO L130 PetriNetUnfolder]: 161/1320 cut-off events. [2023-08-29 02:49:31,359 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2023-08-29 02:49:31,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1320 events. 161/1320 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7056 event pairs, 23 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 908. Up to 80 conditions per place. [2023-08-29 02:49:31,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 255 transitions, 570 flow [2023-08-29 02:49:31,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 255 transitions, 570 flow [2023-08-29 02:49:31,373 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:49:31,373 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 255 transitions, 570 flow [2023-08-29 02:49:31,373 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 255 transitions, 570 flow [2023-08-29 02:49:31,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 255 transitions, 570 flow [2023-08-29 02:49:31,462 INFO L130 PetriNetUnfolder]: 161/1320 cut-off events. [2023-08-29 02:49:31,462 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2023-08-29 02:49:31,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1320 events. 161/1320 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7056 event pairs, 23 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 908. Up to 80 conditions per place. [2023-08-29 02:49:31,491 INFO L119 LiptonReduction]: Number of co-enabled transitions 33440 [2023-08-29 02:49:33,753 INFO L134 LiptonReduction]: Checked pairs total: 86841 [2023-08-29 02:49:33,753 INFO L136 LiptonReduction]: Total number of compositions: 187 [2023-08-29 02:49:33,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:49:33,756 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@21982b3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:49:33,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-29 02:49:33,758 INFO L130 PetriNetUnfolder]: 2/9 cut-off events. [2023-08-29 02:49:33,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:49:33,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:49:33,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:49:33,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-29 02:49:33,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:49:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 85830800, now seen corresponding path program 1 times [2023-08-29 02:49:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:49:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600888924] [2023-08-29 02:49:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:49:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:49:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:49:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:49:33,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:49:33,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600888924] [2023-08-29 02:49:33,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600888924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:49:33,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:49:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:49:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009303710] [2023-08-29 02:49:33,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:49:33,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:49:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:49:33,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:49:33,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:49:33,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 442 [2023-08-29 02:49:33,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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) [2023-08-29 02:49:33,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:49:33,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 442 [2023-08-29 02:49:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:08,460 INFO L130 PetriNetUnfolder]: 913938/1231642 cut-off events. [2023-08-29 02:51:08,460 INFO L131 PetriNetUnfolder]: For 59941/59941 co-relation queries the response was YES. [2023-08-29 02:51:11,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405546 conditions, 1231642 events. 913938/1231642 cut-off events. For 59941/59941 co-relation queries the response was YES. Maximal size of possible extension queue 30370. Compared 10397311 event pairs, 705606 based on Foata normal form. 122084/1201358 useless extension candidates. Maximal degree in co-relation 327797. Up to 1144953 conditions per place. [2023-08-29 02:51:16,133 INFO L137 encePairwiseOnDemand]: 420/442 looper letters, 62 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2023-08-29 02:51:16,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 372 flow [2023-08-29 02:51:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2023-08-29 02:51:16,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444947209653092 [2023-08-29 02:51:16,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2023-08-29 02:51:16,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2023-08-29 02:51:16,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:16,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2023-08-29 02:51:16,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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) [2023-08-29 02:51:16,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 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) [2023-08-29 02:51:16,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 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) [2023-08-29 02:51:16,156 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 268 flow. Second operand 3 states and 722 transitions. [2023-08-29 02:51:16,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 372 flow [2023-08-29 02:51:16,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 92 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:51:16,173 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 242 flow [2023-08-29 02:51:16,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2023-08-29 02:51:16,174 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 2 predicate places. [2023-08-29 02:51:16,174 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 242 flow [2023-08-29 02:51:16,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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) [2023-08-29 02:51:16,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:16,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:16,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 02:51:16,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-29 02:51:16,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1437503451, now seen corresponding path program 1 times [2023-08-29 02:51:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572614553] [2023-08-29 02:51:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:51:16,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572614553] [2023-08-29 02:51:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572614553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:16,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:16,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169858685] [2023-08-29 02:51:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:16,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:16,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:16,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 442 [2023-08-29 02:51:16,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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) [2023-08-29 02:51:16,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:16,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 442 [2023-08-29 02:51:16,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand