./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.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_28-funptr_racefree.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 5b90ecb07ae966182b79ce4444e238e18068c02297f514a326dfeeed6dbb5499 --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:51:29,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 02:51:29,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 02:51:29,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 02:51:29,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 02:51:29,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 02:51:29,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 02:51:29,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 02:51:29,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 02:51:29,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 02:51:29,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 02:51:29,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 02:51:29,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 02:51:29,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 02:51:29,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 02:51:29,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 02:51:29,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 02:51:29,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 02:51:29,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 02:51:29,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 02:51:29,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 02:51:29,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 02:51:29,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 02:51:29,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 02:51:29,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 02:51:29,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 02:51:29,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 02:51:29,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 02:51:29,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 02:51:29,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 02:51:29,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 02:51:29,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 02:51:29,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 02:51:29,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 02:51:29,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 02:51:29,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 02:51:29,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 02:51:29,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 02:51:29,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 02:51:29,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 02:51:29,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 02:51:29,936 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:51:29,966 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 02:51:29,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 02:51:29,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 02:51:29,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 02:51:29,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 02:51:29,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 02:51:29,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 02:51:29,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 02:51:29,969 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 02:51:29,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 02:51:29,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 02:51:29,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 02:51:29,971 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 02:51:29,971 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 02:51:29,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 02:51:29,971 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 02:51:29,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 02:51:29,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 02:51:29,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 02:51:29,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 02:51:29,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:51:29,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 02:51:29,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 02:51:29,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 02:51:29,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 02:51:29,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 02:51:29,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 02:51:29,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 02:51:29,973 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 02:51:29,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 02:51:29,974 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 02:51:29,974 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 -> 5b90ecb07ae966182b79ce4444e238e18068c02297f514a326dfeeed6dbb5499 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:51:30,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 02:51:30,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 02:51:30,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 02:51:30,244 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 02:51:30,244 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 02:51:30,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2023-08-29 02:51:31,414 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 02:51:31,742 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 02:51:31,743 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2023-08-29 02:51:31,757 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6202e985a/949db97032ad4e8ba06d39e7422266b9/FLAG3cb13aeef [2023-08-29 02:51:31,766 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6202e985a/949db97032ad4e8ba06d39e7422266b9 [2023-08-29 02:51:31,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 02:51:31,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 02:51:31,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 02:51:31,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 02:51:31,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 02:51:31,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:51:31" (1/1) ... [2023-08-29 02:51:31,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3717a578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:31, skipping insertion in model container [2023-08-29 02:51:31,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:51:31" (1/1) ... [2023-08-29 02:51:31,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 02:51:31,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 02:51:32,074 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_28-funptr_racefree.i[41323,41336] [2023-08-29 02:51:32,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:51:32,107 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 02:51:32,136 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_28-funptr_racefree.i[41323,41336] [2023-08-29 02:51:32,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:51:32,222 WARN L667 CHandler]: The function g is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 02:51:32,227 INFO L208 MainTranslator]: Completed translation [2023-08-29 02:51:32,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32 WrapperNode [2023-08-29 02:51:32,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 02:51:32,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 02:51:32,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 02:51:32,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 02:51:32,233 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:51:32" (1/1) ... [2023-08-29 02:51:32,269 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:51:32" (1/1) ... [2023-08-29 02:51:32,286 INFO L138 Inliner]: procedures = 273, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-29 02:51:32,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 02:51:32,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 02:51:32,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 02:51:32,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 02:51:32,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 02:51:32,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 02:51:32,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 02:51:32,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 02:51:32,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (1/1) ... [2023-08-29 02:51:32,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:51:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:51:32,328 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:51:32,348 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:51:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 02:51:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 02:51:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 02:51:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 02:51:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 02:51:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 02:51:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 02:51:32,359 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 02:51:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 02:51:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 02:51:32,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 02:51:32,360 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:51:32,446 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 02:51:32,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 02:51:32,651 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 02:51:32,656 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 02:51:32,665 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-29 02:51:32,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:51:32 BoogieIcfgContainer [2023-08-29 02:51:32,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 02:51:32,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 02:51:32,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 02:51:32,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 02:51:32,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:51:31" (1/3) ... [2023-08-29 02:51:32,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7075c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:51:32, skipping insertion in model container [2023-08-29 02:51:32,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:51:32" (2/3) ... [2023-08-29 02:51:32,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7075c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:51:32, skipping insertion in model container [2023-08-29 02:51:32,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:51:32" (3/3) ... [2023-08-29 02:51:32,672 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2023-08-29 02:51:32,678 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 02:51:32,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 02:51:32,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-29 02:51:32,687 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 02:51:32,747 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 02:51:32,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:32,828 INFO L130 PetriNetUnfolder]: 17/201 cut-off events. [2023-08-29 02:51:32,832 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:51:32,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 201 events. 17/201 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 558 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2023-08-29 02:51:32,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:32,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:32,852 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:51:32,868 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:32,874 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:32,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:32,946 INFO L130 PetriNetUnfolder]: 17/201 cut-off events. [2023-08-29 02:51:32,952 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:51:32,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 201 events. 17/201 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 558 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2023-08-29 02:51:32,958 INFO L119 LiptonReduction]: Number of co-enabled transitions 6160 [2023-08-29 02:51:35,738 INFO L134 LiptonReduction]: Checked pairs total: 18288 [2023-08-29 02:51:35,750 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-29 02:51:35,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:51:35,775 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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:51:35,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 02:51:35,791 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:51:35,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:51:35,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:35,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:51:35,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:35,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 520685617, now seen corresponding path program 1 times [2023-08-29 02:51:35,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602710427] [2023-08-29 02:51:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:36,006 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:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602710427] [2023-08-29 02:51:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602710427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:36,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931700169] [2023-08-29 02:51:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:36,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:36,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 255 [2023-08-29 02:51:36,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 61 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:36,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:36,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 255 [2023-08-29 02:51:36,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:36,165 INFO L130 PetriNetUnfolder]: 196/530 cut-off events. [2023-08-29 02:51:36,165 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:51:36,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 530 events. 196/530 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2749 event pairs, 0 based on Foata normal form. 45/505 useless extension candidates. Maximal degree in co-relation 928. Up to 411 conditions per place. [2023-08-29 02:51:36,171 INFO L137 encePairwiseOnDemand]: 242/255 looper letters, 43 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2023-08-29 02:51:36,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 234 flow [2023-08-29 02:51:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-29 02:51:36,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6052287581699346 [2023-08-29 02:51:36,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-29 02:51:36,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-29 02:51:36,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:36,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-29 02:51:36,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:36,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:36,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:36,199 INFO L175 Difference]: Start difference. First operand has 54 places, 61 transitions, 130 flow. Second operand 3 states and 463 transitions. [2023-08-29 02:51:36,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 234 flow [2023-08-29 02:51:36,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:51:36,203 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 111 flow [2023-08-29 02:51:36,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-29 02:51:36,208 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2023-08-29 02:51:36,209 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 111 flow [2023-08-29 02:51:36,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:36,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:36,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 02:51:36,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 02:51:36,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:36,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1021195238, now seen corresponding path program 1 times [2023-08-29 02:51:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:36,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902744487] [2023-08-29 02:51:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:36,293 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:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:36,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902744487] [2023-08-29 02:51:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902744487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637477666] [2023-08-29 02:51:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:36,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:36,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 255 [2023-08-29 02:51:36,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 111 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:51:36,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:36,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 255 [2023-08-29 02:51:36,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:36,432 INFO L130 PetriNetUnfolder]: 358/1014 cut-off events. [2023-08-29 02:51:36,432 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2023-08-29 02:51:36,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1014 events. 358/1014 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6205 event pairs, 23 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1833. Up to 430 conditions per place. [2023-08-29 02:51:36,435 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 58 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-29 02:51:36,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 294 flow [2023-08-29 02:51:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-29 02:51:36,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6026143790849673 [2023-08-29 02:51:36,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-29 02:51:36,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-29 02:51:36,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:36,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-29 02:51:36,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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:36,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:36,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:36,440 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 111 flow. Second operand 3 states and 461 transitions. [2023-08-29 02:51:36,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 294 flow [2023-08-29 02:51:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:36,442 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 129 flow [2023-08-29 02:51:36,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2023-08-29 02:51:36,443 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-29 02:51:36,443 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 129 flow [2023-08-29 02:51:36,443 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:51:36,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:36,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:36,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 02:51:36,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:36,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2098702987, now seen corresponding path program 1 times [2023-08-29 02:51:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:36,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789301295] [2023-08-29 02:51:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:36,528 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:51:36,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789301295] [2023-08-29 02:51:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789301295] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:51:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526829113] [2023-08-29 02:51:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:51:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:51:36,546 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:51:36,568 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:51:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:36,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:51:36,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:51:36,673 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:51:36,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:51:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526829113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:36,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:51:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:51:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143183974] [2023-08-29 02:51:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:36,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:36,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:51:36,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 255 [2023-08-29 02:51:36,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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:36,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:36,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 255 [2023-08-29 02:51:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:36,825 INFO L130 PetriNetUnfolder]: 361/1009 cut-off events. [2023-08-29 02:51:36,825 INFO L131 PetriNetUnfolder]: For 93/94 co-relation queries the response was YES. [2023-08-29 02:51:36,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1009 events. 361/1009 cut-off events. For 93/94 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6079 event pairs, 311 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1886. Up to 737 conditions per place. [2023-08-29 02:51:36,829 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 45 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-29 02:51:36,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 263 flow [2023-08-29 02:51:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-29 02:51:36,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5738562091503268 [2023-08-29 02:51:36,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-29 02:51:36,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-29 02:51:36,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:36,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-29 02:51:36,833 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:51:36,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:36,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:36,834 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 129 flow. Second operand 3 states and 439 transitions. [2023-08-29 02:51:36,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 263 flow [2023-08-29 02:51:36,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:36,836 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 147 flow [2023-08-29 02:51:36,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-29 02:51:36,837 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-29 02:51:36,837 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 147 flow [2023-08-29 02:51:36,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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:36,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:36,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:36,859 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:51:37,043 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:51:37,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:37,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2062642748, now seen corresponding path program 1 times [2023-08-29 02:51:37,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113578584] [2023-08-29 02:51:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:37,093 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:51:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113578584] [2023-08-29 02:51:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113578584] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:51:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518157758] [2023-08-29 02:51:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:51:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:51:37,105 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:51:37,108 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:51:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:37,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:51:37,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:51:37,198 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:51:37,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:51:37,214 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:51:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518157758] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:51:37,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:51:37,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:51:37,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247979115] [2023-08-29 02:51:37,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:51:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:51:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:51:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:51:37,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 255 [2023-08-29 02:51:37,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 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:37,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:37,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 255 [2023-08-29 02:51:37,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:37,280 INFO L130 PetriNetUnfolder]: 28/102 cut-off events. [2023-08-29 02:51:37,281 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:51:37,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 102 events. 28/102 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 240 event pairs, 0 based on Foata normal form. 15/113 useless extension candidates. Maximal degree in co-relation 212. Up to 58 conditions per place. [2023-08-29 02:51:37,282 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 25 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2023-08-29 02:51:37,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 171 flow [2023-08-29 02:51:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:51:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:51:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-29 02:51:37,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509803921568628 [2023-08-29 02:51:37,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-29 02:51:37,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-29 02:51:37,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:37,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-29 02:51:37,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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:37,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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:37,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 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:37,287 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 147 flow. Second operand 4 states and 562 transitions. [2023-08-29 02:51:37,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 171 flow [2023-08-29 02:51:37,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 163 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 02:51:37,289 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 65 flow [2023-08-29 02:51:37,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=65, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-29 02:51:37,289 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -16 predicate places. [2023-08-29 02:51:37,290 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 65 flow [2023-08-29 02:51:37,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 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:37,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:37,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:37,310 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:51:37,495 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:51:37,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:37,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1579546924, now seen corresponding path program 1 times [2023-08-29 02:51:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:37,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710569184] [2023-08-29 02:51:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:37,550 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:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710569184] [2023-08-29 02:51:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710569184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782281647] [2023-08-29 02:51:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:37,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:37,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:37,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 255 [2023-08-29 02:51:37,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:37,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:37,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 255 [2023-08-29 02:51:37,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:37,603 INFO L130 PetriNetUnfolder]: 26/95 cut-off events. [2023-08-29 02:51:37,604 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-29 02:51:37,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 95 events. 26/95 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 167 event pairs, 16 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 183. Up to 46 conditions per place. [2023-08-29 02:51:37,604 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 15 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2023-08-29 02:51:37,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 105 flow [2023-08-29 02:51:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-29 02:51:37,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215686274509804 [2023-08-29 02:51:37,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-29 02:51:37,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-29 02:51:37,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:37,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-29 02:51:37,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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:37,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:37,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:37,610 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 65 flow. Second operand 3 states and 399 transitions. [2023-08-29 02:51:37,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 105 flow [2023-08-29 02:51:37,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:37,612 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 66 flow [2023-08-29 02:51:37,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-08-29 02:51:37,615 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -21 predicate places. [2023-08-29 02:51:37,615 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 66 flow [2023-08-29 02:51:37,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:37,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:37,615 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:51:37,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 02:51:37,616 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:37,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 622359011, now seen corresponding path program 1 times [2023-08-29 02:51:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243539001] [2023-08-29 02:51:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:37,655 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:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243539001] [2023-08-29 02:51:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243539001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:37,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826348891] [2023-08-29 02:51:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:37,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:37,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:37,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 255 [2023-08-29 02:51:37,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:37,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:37,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 255 [2023-08-29 02:51:37,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:37,715 INFO L130 PetriNetUnfolder]: 24/90 cut-off events. [2023-08-29 02:51:37,715 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:51:37,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 90 events. 24/90 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 149 event pairs, 22 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 183. Up to 61 conditions per place. [2023-08-29 02:51:37,716 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 16 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-29 02:51:37,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 105 flow [2023-08-29 02:51:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-29 02:51:37,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228758169934641 [2023-08-29 02:51:37,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-29 02:51:37,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-29 02:51:37,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:37,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-29 02:51:37,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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:37,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:37,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:37,720 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 66 flow. Second operand 3 states and 400 transitions. [2023-08-29 02:51:37,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 105 flow [2023-08-29 02:51:37,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 97 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:37,721 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 60 flow [2023-08-29 02:51:37,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2023-08-29 02:51:37,722 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -22 predicate places. [2023-08-29 02:51:37,722 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 60 flow [2023-08-29 02:51:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:37,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:37,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:37,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 02:51:37,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-08-29 02:51:37,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:37,723 INFO L85 PathProgramCache]: Analyzing trace with hash -42788995, now seen corresponding path program 1 times [2023-08-29 02:51:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:37,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556095954] [2023-08-29 02:51:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:37,746 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:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:37,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556095954] [2023-08-29 02:51:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556095954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794810718] [2023-08-29 02:51:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:37,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:37,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:37,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:37,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 255 [2023-08-29 02:51:37,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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:37,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:37,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 255 [2023-08-29 02:51:37,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:37,793 INFO L130 PetriNetUnfolder]: 24/87 cut-off events. [2023-08-29 02:51:37,793 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 02:51:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 87 events. 24/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 22 based on Foata normal form. 3/90 useless extension candidates. Maximal degree in co-relation 174. Up to 61 conditions per place. [2023-08-29 02:51:37,794 INFO L137 encePairwiseOnDemand]: 253/255 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2023-08-29 02:51:37,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 99 flow [2023-08-29 02:51:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-29 02:51:37,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228758169934641 [2023-08-29 02:51:37,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-29 02:51:37,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-29 02:51:37,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:37,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-29 02:51:37,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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:37,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:37,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 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:37,798 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 60 flow. Second operand 3 states and 400 transitions. [2023-08-29 02:51:37,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 99 flow [2023-08-29 02:51:37,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 95 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:37,798 INFO L231 Difference]: Finished difference. Result has 31 places, 0 transitions, 0 flow [2023-08-29 02:51:37,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=3, PETRI_FLOW=0, PETRI_PLACES=31, PETRI_TRANSITIONS=0} [2023-08-29 02:51:37,799 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -23 predicate places. [2023-08-29 02:51:37,799 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 0 transitions, 0 flow [2023-08-29 02:51:37,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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:37,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2023-08-29 02:51:37,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-08-29 02:51:37,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-08-29 02:51:37,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-08-29 02:51:37,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-08-29 02:51:37,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-08-29 02:51:37,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-08-29 02:51:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 02:51:37,804 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:37,805 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:51:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:37,820 INFO L130 PetriNetUnfolder]: 17/201 cut-off events. [2023-08-29 02:51:37,820 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:51:37,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 201 events. 17/201 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 558 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2023-08-29 02:51:37,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 151 transitions, 310 flow [2023-08-29 02:51:37,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 146 transitions, 297 flow [2023-08-29 02:51:37,822 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:51:37,822 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 146 transitions, 297 flow [2023-08-29 02:51:37,822 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 146 transitions, 297 flow [2023-08-29 02:51:37,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 146 transitions, 297 flow [2023-08-29 02:51:37,833 INFO L130 PetriNetUnfolder]: 16/196 cut-off events. [2023-08-29 02:51:37,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:51:37,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 196 events. 16/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 557 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2023-08-29 02:51:37,835 INFO L119 LiptonReduction]: Number of co-enabled transitions 6160 [2023-08-29 02:51:40,529 INFO L134 LiptonReduction]: Checked pairs total: 20194 [2023-08-29 02:51:40,532 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-29 02:51:40,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:51:40,537 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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:51:40,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:51:40,539 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-08-29 02:51:40,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:51:40,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:40,539 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 02:51:40,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:51:40,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1961896372, now seen corresponding path program 1 times [2023-08-29 02:51:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805967114] [2023-08-29 02:51:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:51:40,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:51:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:51:40,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:51:40,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:51:40,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:51:40,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 02:51:40,583 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:51:40,584 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:51:40,584 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:51:40,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 02:51:40,597 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 02:51:40,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:40,619 INFO L130 PetriNetUnfolder]: 31/338 cut-off events. [2023-08-29 02:51:40,619 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:51:40,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 338 events. 31/338 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1192 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 203. Up to 8 conditions per place. [2023-08-29 02:51:40,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:40,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:40,623 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:51:40,623 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:40,623 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:40,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:40,651 INFO L130 PetriNetUnfolder]: 31/338 cut-off events. [2023-08-29 02:51:40,652 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:51:40,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 338 events. 31/338 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1192 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 203. Up to 8 conditions per place. [2023-08-29 02:51:40,660 INFO L119 LiptonReduction]: Number of co-enabled transitions 19580 [2023-08-29 02:51:42,439 INFO L134 LiptonReduction]: Checked pairs total: 71968 [2023-08-29 02:51:42,440 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-29 02:51:42,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:51:42,443 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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:51:42,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-29 02:51:42,445 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:51:42,445 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:51:42,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:42,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:51:42,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:42,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 988963598, now seen corresponding path program 1 times [2023-08-29 02:51:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:42,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521133954] [2023-08-29 02:51:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:42,465 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:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521133954] [2023-08-29 02:51:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521133954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822225521] [2023-08-29 02:51:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:42,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:42,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 333 [2023-08-29 02:51:42,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 102 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:42,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:42,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 333 [2023-08-29 02:51:42,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:43,274 INFO L130 PetriNetUnfolder]: 5540/11752 cut-off events. [2023-08-29 02:51:43,274 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-29 02:51:43,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20624 conditions, 11752 events. 5540/11752 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 99395 event pairs, 2600 based on Foata normal form. 1316/11828 useless extension candidates. Maximal degree in co-relation 1418. Up to 8751 conditions per place. [2023-08-29 02:51:43,322 INFO L137 encePairwiseOnDemand]: 314/333 looper letters, 59 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2023-08-29 02:51:43,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 101 transitions, 342 flow [2023-08-29 02:51:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-29 02:51:43,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6306306306306306 [2023-08-29 02:51:43,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-29 02:51:43,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-29 02:51:43,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:43,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-29 02:51:43,326 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:51:43,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:43,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:43,328 INFO L175 Difference]: Start difference. First operand has 90 places, 102 transitions, 222 flow. Second operand 3 states and 630 transitions. [2023-08-29 02:51:43,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 101 transitions, 342 flow [2023-08-29 02:51:43,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:51:43,331 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 202 flow [2023-08-29 02:51:43,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2023-08-29 02:51:43,333 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 2 predicate places. [2023-08-29 02:51:43,333 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 202 flow [2023-08-29 02:51:43,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:43,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:43,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 02:51:43,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 02:51:43,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:43,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash 610364117, now seen corresponding path program 1 times [2023-08-29 02:51:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:43,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442889297] [2023-08-29 02:51:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:43,358 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:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442889297] [2023-08-29 02:51:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442889297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727260272] [2023-08-29 02:51:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:43,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:43,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:43,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 333 [2023-08-29 02:51:43,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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:43,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:43,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 333 [2023-08-29 02:51:43,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:44,994 INFO L130 PetriNetUnfolder]: 11266/22941 cut-off events. [2023-08-29 02:51:44,996 INFO L131 PetriNetUnfolder]: For 594/594 co-relation queries the response was YES. [2023-08-29 02:51:45,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41527 conditions, 22941 events. 11266/22941 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 211954 event pairs, 3064 based on Foata normal form. 0/20458 useless extension candidates. Maximal degree in co-relation 41409. Up to 10767 conditions per place. [2023-08-29 02:51:45,200 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 93 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2023-08-29 02:51:45,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 134 transitions, 510 flow [2023-08-29 02:51:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2023-08-29 02:51:45,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6356356356356356 [2023-08-29 02:51:45,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 635 transitions. [2023-08-29 02:51:45,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 635 transitions. [2023-08-29 02:51:45,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:45,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 635 transitions. [2023-08-29 02:51:45,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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:45,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:45,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:45,206 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 202 flow. Second operand 3 states and 635 transitions. [2023-08-29 02:51:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 134 transitions, 510 flow [2023-08-29 02:51:45,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:51:45,213 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 244 flow [2023-08-29 02:51:45,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2023-08-29 02:51:45,214 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2023-08-29 02:51:45,214 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 244 flow [2023-08-29 02:51:45,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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:45,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:45,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:45,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 02:51:45,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:45,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1321573384, now seen corresponding path program 1 times [2023-08-29 02:51:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086143963] [2023-08-29 02:51:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:45,261 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:51:45,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086143963] [2023-08-29 02:51:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086143963] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:51:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061473925] [2023-08-29 02:51:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:45,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:51:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:51:45,279 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:51:45,280 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:51:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:45,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:51:45,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:51:45,354 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:51:45,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:51:45,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061473925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:45,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:51:45,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:51:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248292822] [2023-08-29 02:51:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:45,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:51:45,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 333 [2023-08-29 02:51:45,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:45,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:45,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 333 [2023-08-29 02:51:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:46,810 INFO L130 PetriNetUnfolder]: 10933/22967 cut-off events. [2023-08-29 02:51:46,810 INFO L131 PetriNetUnfolder]: For 2639/2639 co-relation queries the response was YES. [2023-08-29 02:51:46,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42943 conditions, 22967 events. 10933/22967 cut-off events. For 2639/2639 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 216623 event pairs, 9095 based on Foata normal form. 0/20342 useless extension candidates. Maximal degree in co-relation 19121. Up to 16559 conditions per place. [2023-08-29 02:51:46,920 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 73 selfloop transitions, 7 changer transitions 0/121 dead transitions. [2023-08-29 02:51:46,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 121 transitions, 474 flow [2023-08-29 02:51:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-08-29 02:51:46,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6096096096096096 [2023-08-29 02:51:46,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-08-29 02:51:46,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-08-29 02:51:46,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:46,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-08-29 02:51:46,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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:46,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:46,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:46,925 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 244 flow. Second operand 3 states and 609 transitions. [2023-08-29 02:51:46,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 121 transitions, 474 flow [2023-08-29 02:51:46,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 121 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:46,932 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 285 flow [2023-08-29 02:51:46,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2023-08-29 02:51:46,932 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2023-08-29 02:51:46,932 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 285 flow [2023-08-29 02:51:46,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:46,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:46,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:46,955 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:51:47,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:51:47,138 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:47,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1212335018, now seen corresponding path program 1 times [2023-08-29 02:51:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011036010] [2023-08-29 02:51:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:47,164 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:51:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011036010] [2023-08-29 02:51:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011036010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:51:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586439440] [2023-08-29 02:51:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:51:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:51:47,166 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:51:47,179 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:51:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:47,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:51:47,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:51:47,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:51:47,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:51:47,261 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:51:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586439440] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:51:47,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:51:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:51:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850051] [2023-08-29 02:51:47,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:51:47,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:51:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:51:47,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:51:47,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 333 [2023-08-29 02:51:47,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 183.85714285714286) internal successors, (1287), 7 states have internal predecessors, (1287), 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:47,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:47,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 333 [2023-08-29 02:51:47,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:47,607 INFO L130 PetriNetUnfolder]: 971/2108 cut-off events. [2023-08-29 02:51:47,607 INFO L131 PetriNetUnfolder]: For 688/688 co-relation queries the response was YES. [2023-08-29 02:51:47,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 2108 events. 971/2108 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 13305 event pairs, 4 based on Foata normal form. 223/2276 useless extension candidates. Maximal degree in co-relation 4633. Up to 1176 conditions per place. [2023-08-29 02:51:47,614 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 74 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2023-08-29 02:51:47,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 430 flow [2023-08-29 02:51:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 02:51:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 02:51:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 980 transitions. [2023-08-29 02:51:47,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5885885885885885 [2023-08-29 02:51:47,617 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 980 transitions. [2023-08-29 02:51:47,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 980 transitions. [2023-08-29 02:51:47,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:47,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 980 transitions. [2023-08-29 02:51:47,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 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:47,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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:47,621 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 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:47,621 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 285 flow. Second operand 5 states and 980 transitions. [2023-08-29 02:51:47,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 430 flow [2023-08-29 02:51:47,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 410 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-29 02:51:47,623 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 166 flow [2023-08-29 02:51:47,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-08-29 02:51:47,624 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -13 predicate places. [2023-08-29 02:51:47,624 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 166 flow [2023-08-29 02:51:47,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 183.85714285714286) internal successors, (1287), 7 states have internal predecessors, (1287), 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:47,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:47,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:47,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 02:51:47,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:51:47,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:47,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1682344911, now seen corresponding path program 1 times [2023-08-29 02:51:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674142400] [2023-08-29 02:51:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:47,863 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:47,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:47,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674142400] [2023-08-29 02:51:47,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674142400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:47,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450430359] [2023-08-29 02:51:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:47,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:47,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:47,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 333 [2023-08-29 02:51:47,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 166 flow. Second operand has 3 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:51:47,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:47,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 333 [2023-08-29 02:51:47,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:48,114 INFO L130 PetriNetUnfolder]: 2101/4107 cut-off events. [2023-08-29 02:51:48,114 INFO L131 PetriNetUnfolder]: For 1564/1564 co-relation queries the response was YES. [2023-08-29 02:51:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8786 conditions, 4107 events. 2101/4107 cut-off events. For 1564/1564 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 25969 event pairs, 1068 based on Foata normal form. 0/4009 useless extension candidates. Maximal degree in co-relation 8778. Up to 2046 conditions per place. [2023-08-29 02:51:48,129 INFO L137 encePairwiseOnDemand]: 317/333 looper letters, 72 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2023-08-29 02:51:48,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 427 flow [2023-08-29 02:51:48,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-08-29 02:51:48,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5855855855855856 [2023-08-29 02:51:48,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-08-29 02:51:48,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-08-29 02:51:48,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:48,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-08-29 02:51:48,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:48,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:48,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:48,134 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 166 flow. Second operand 3 states and 585 transitions. [2023-08-29 02:51:48,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 427 flow [2023-08-29 02:51:48,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 416 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 02:51:48,137 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 263 flow [2023-08-29 02:51:48,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2023-08-29 02:51:48,138 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -12 predicate places. [2023-08-29 02:51:48,138 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 263 flow [2023-08-29 02:51:48,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:51:48,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:48,138 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:51:48,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 02:51:48,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:48,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2064322446, now seen corresponding path program 1 times [2023-08-29 02:51:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068777132] [2023-08-29 02:51:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:48,158 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:48,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:48,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068777132] [2023-08-29 02:51:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068777132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:48,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375887834] [2023-08-29 02:51:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:48,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:48,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 333 [2023-08-29 02:51:48,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:48,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:48,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 333 [2023-08-29 02:51:48,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:48,427 INFO L130 PetriNetUnfolder]: 1759/3642 cut-off events. [2023-08-29 02:51:48,427 INFO L131 PetriNetUnfolder]: For 1609/1621 co-relation queries the response was YES. [2023-08-29 02:51:48,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8460 conditions, 3642 events. 1759/3642 cut-off events. For 1609/1621 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 23775 event pairs, 1390 based on Foata normal form. 0/3514 useless extension candidates. Maximal degree in co-relation 8452. Up to 2740 conditions per place. [2023-08-29 02:51:48,438 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 61 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2023-08-29 02:51:48,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 480 flow [2023-08-29 02:51:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-08-29 02:51:48,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5735735735735735 [2023-08-29 02:51:48,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-08-29 02:51:48,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-08-29 02:51:48,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:48,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-08-29 02:51:48,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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:48,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:48,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:48,443 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 263 flow. Second operand 3 states and 573 transitions. [2023-08-29 02:51:48,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 480 flow [2023-08-29 02:51:48,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:51:48,446 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 308 flow [2023-08-29 02:51:48,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2023-08-29 02:51:48,447 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -11 predicate places. [2023-08-29 02:51:48,447 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 308 flow [2023-08-29 02:51:48,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:48,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:48,447 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:48,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 02:51:48,448 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:48,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1216106594, now seen corresponding path program 1 times [2023-08-29 02:51:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:48,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419857932] [2023-08-29 02:51:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:51:48,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:48,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419857932] [2023-08-29 02:51:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419857932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:48,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:48,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:48,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129813757] [2023-08-29 02:51:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:48,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:48,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 333 [2023-08-29 02:51:48,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:48,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:48,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 333 [2023-08-29 02:51:48,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:48,712 INFO L130 PetriNetUnfolder]: 1813/3726 cut-off events. [2023-08-29 02:51:48,712 INFO L131 PetriNetUnfolder]: For 1825/1852 co-relation queries the response was YES. [2023-08-29 02:51:48,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 3726 events. 1813/3726 cut-off events. For 1825/1852 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 24364 event pairs, 1403 based on Foata normal form. 0/3568 useless extension candidates. Maximal degree in co-relation 8737. Up to 2834 conditions per place. [2023-08-29 02:51:48,730 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 62 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2023-08-29 02:51:48,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 104 transitions, 516 flow [2023-08-29 02:51:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-08-29 02:51:48,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5705705705705706 [2023-08-29 02:51:48,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-08-29 02:51:48,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-08-29 02:51:48,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:48,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-08-29 02:51:48,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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:48,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:48,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:48,736 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 308 flow. Second operand 3 states and 570 transitions. [2023-08-29 02:51:48,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 104 transitions, 516 flow [2023-08-29 02:51:48,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:51:48,740 INFO L231 Difference]: Finished difference. Result has 81 places, 92 transitions, 378 flow [2023-08-29 02:51:48,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=81, PETRI_TRANSITIONS=92} [2023-08-29 02:51:48,741 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -9 predicate places. [2023-08-29 02:51:48,741 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 378 flow [2023-08-29 02:51:48,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:48,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:48,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:48,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 02:51:48,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:48,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2096645424, now seen corresponding path program 1 times [2023-08-29 02:51:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561334498] [2023-08-29 02:51:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:48,768 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:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561334498] [2023-08-29 02:51:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561334498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90547569] [2023-08-29 02:51:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:48,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:48,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:48,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 333 [2023-08-29 02:51:48,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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:48,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:48,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 333 [2023-08-29 02:51:48,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:49,051 INFO L130 PetriNetUnfolder]: 1882/3813 cut-off events. [2023-08-29 02:51:49,052 INFO L131 PetriNetUnfolder]: For 2674/2722 co-relation queries the response was YES. [2023-08-29 02:51:49,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9464 conditions, 3813 events. 1882/3813 cut-off events. For 2674/2722 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24685 event pairs, 1390 based on Foata normal form. 0/3637 useless extension candidates. Maximal degree in co-relation 9454. Up to 2908 conditions per place. [2023-08-29 02:51:49,069 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 70 selfloop transitions, 11 changer transitions 3/115 dead transitions. [2023-08-29 02:51:49,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 635 flow [2023-08-29 02:51:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-08-29 02:51:49,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5735735735735735 [2023-08-29 02:51:49,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-08-29 02:51:49,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-08-29 02:51:49,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:49,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-08-29 02:51:49,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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:49,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:49,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:49,075 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 378 flow. Second operand 3 states and 573 transitions. [2023-08-29 02:51:49,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 635 flow [2023-08-29 02:51:49,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:51:49,080 INFO L231 Difference]: Finished difference. Result has 83 places, 99 transitions, 458 flow [2023-08-29 02:51:49,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=83, PETRI_TRANSITIONS=99} [2023-08-29 02:51:49,081 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -7 predicate places. [2023-08-29 02:51:49,081 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 99 transitions, 458 flow [2023-08-29 02:51:49,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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:49,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:49,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:49,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 02:51:49,082 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:49,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1879257294, now seen corresponding path program 1 times [2023-08-29 02:51:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873796769] [2023-08-29 02:51:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:51:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873796769] [2023-08-29 02:51:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873796769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:49,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400139432] [2023-08-29 02:51:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:49,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:49,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 333 [2023-08-29 02:51:49,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 99 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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:49,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:49,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 333 [2023-08-29 02:51:49,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:49,453 INFO L130 PetriNetUnfolder]: 1978/3963 cut-off events. [2023-08-29 02:51:49,454 INFO L131 PetriNetUnfolder]: For 3769/3835 co-relation queries the response was YES. [2023-08-29 02:51:49,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 3963 events. 1978/3963 cut-off events. For 3769/3835 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 25546 event pairs, 1330 based on Foata normal form. 3/3772 useless extension candidates. Maximal degree in co-relation 10375. Up to 2896 conditions per place. [2023-08-29 02:51:49,473 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 69 selfloop transitions, 13 changer transitions 8/121 dead transitions. [2023-08-29 02:51:49,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 121 transitions, 729 flow [2023-08-29 02:51:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:51:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:51:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2023-08-29 02:51:49,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5715715715715716 [2023-08-29 02:51:49,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2023-08-29 02:51:49,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2023-08-29 02:51:49,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:49,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2023-08-29 02:51:49,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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:49,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:49,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 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:49,479 INFO L175 Difference]: Start difference. First operand has 83 places, 99 transitions, 458 flow. Second operand 3 states and 571 transitions. [2023-08-29 02:51:49,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 121 transitions, 729 flow [2023-08-29 02:51:49,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 703 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 02:51:49,488 INFO L231 Difference]: Finished difference. Result has 86 places, 104 transitions, 543 flow [2023-08-29 02:51:49,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=86, PETRI_TRANSITIONS=104} [2023-08-29 02:51:49,489 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -4 predicate places. [2023-08-29 02:51:49,489 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 543 flow [2023-08-29 02:51:49,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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:49,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:49,490 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:49,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 02:51:49,490 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:51:49,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -135042863, now seen corresponding path program 1 times [2023-08-29 02:51:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331407821] [2023-08-29 02:51:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:49,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:51:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331407821] [2023-08-29 02:51:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331407821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 02:51:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033882774] [2023-08-29 02:51:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:49,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 02:51:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:49,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 02:51:49,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:51:49,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 333 [2023-08-29 02:51:49,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 104 transitions, 543 flow. Second operand has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 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:49,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:49,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 333 [2023-08-29 02:51:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:51:49,936 INFO L130 PetriNetUnfolder]: 508/1311 cut-off events. [2023-08-29 02:51:49,936 INFO L131 PetriNetUnfolder]: For 1206/1206 co-relation queries the response was YES. [2023-08-29 02:51:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 1311 events. 508/1311 cut-off events. For 1206/1206 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7450 event pairs, 109 based on Foata normal form. 54/1360 useless extension candidates. Maximal degree in co-relation 3249. Up to 711 conditions per place. [2023-08-29 02:51:49,940 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2023-08-29 02:51:49,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 68 transitions, 342 flow [2023-08-29 02:51:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:51:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:51:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 718 transitions. [2023-08-29 02:51:49,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.539039039039039 [2023-08-29 02:51:49,943 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 718 transitions. [2023-08-29 02:51:49,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 718 transitions. [2023-08-29 02:51:49,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:51:49,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 718 transitions. [2023-08-29 02:51:49,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:51:49,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 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:49,947 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 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:49,947 INFO L175 Difference]: Start difference. First operand has 86 places, 104 transitions, 543 flow. Second operand 4 states and 718 transitions. [2023-08-29 02:51:49,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 68 transitions, 342 flow [2023-08-29 02:51:49,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 264 flow, removed 21 selfloop flow, removed 12 redundant places. [2023-08-29 02:51:49,951 INFO L231 Difference]: Finished difference. Result has 69 places, 0 transitions, 0 flow [2023-08-29 02:51:49,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=69, PETRI_TRANSITIONS=0} [2023-08-29 02:51:49,952 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -21 predicate places. [2023-08-29 02:51:49,952 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 0 transitions, 0 flow [2023-08-29 02:51:49,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 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:49,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2023-08-29 02:51:49,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-08-29 02:51:49,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-08-29 02:51:49,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-08-29 02:51:49,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-08-29 02:51:49,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-08-29 02:51:49,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 02:51:49,955 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:51:49,956 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:51:49,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:49,985 INFO L130 PetriNetUnfolder]: 31/338 cut-off events. [2023-08-29 02:51:49,985 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:51:49,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 338 events. 31/338 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1192 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 203. Up to 8 conditions per place. [2023-08-29 02:51:49,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:49,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:49,989 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:51:49,990 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:49,990 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:49,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 208 transitions, 434 flow [2023-08-29 02:51:50,017 INFO L130 PetriNetUnfolder]: 31/338 cut-off events. [2023-08-29 02:51:50,018 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:51:50,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 338 events. 31/338 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1192 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 203. Up to 8 conditions per place. [2023-08-29 02:51:50,028 INFO L119 LiptonReduction]: Number of co-enabled transitions 19580 [2023-08-29 02:51:52,863 INFO L134 LiptonReduction]: Checked pairs total: 71968 [2023-08-29 02:51:52,863 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-29 02:51:52,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:51:52,869 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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:51:52,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:51:52,874 INFO L130 PetriNetUnfolder]: 1/50 cut-off events. [2023-08-29 02:51:52,874 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 02:51:52,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:52,874 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 02:51:52,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:51:52,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 534508722, now seen corresponding path program 1 times [2023-08-29 02:51:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405516393] [2023-08-29 02:51:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:51:52,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:51:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:51:52,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:51:52,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:51:52,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:51:52,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 02:51:52,906 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:51:52,906 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:51:52,906 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:51:52,906 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 02:51:52,938 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 02:51:52,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 265 transitions, 560 flow [2023-08-29 02:51:52,996 INFO L130 PetriNetUnfolder]: 50/518 cut-off events. [2023-08-29 02:51:52,997 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:51:53,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 518 events. 50/518 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2136 event pairs, 1 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 346. Up to 16 conditions per place. [2023-08-29 02:51:53,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 265 transitions, 560 flow [2023-08-29 02:51:53,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 265 transitions, 560 flow [2023-08-29 02:51:53,008 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:51:53,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 265 transitions, 560 flow [2023-08-29 02:51:53,008 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 265 transitions, 560 flow [2023-08-29 02:51:53,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 265 transitions, 560 flow [2023-08-29 02:51:53,090 INFO L130 PetriNetUnfolder]: 50/518 cut-off events. [2023-08-29 02:51:53,091 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:51:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 518 events. 50/518 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2136 event pairs, 1 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 346. Up to 16 conditions per place. [2023-08-29 02:51:53,105 INFO L119 LiptonReduction]: Number of co-enabled transitions 38940 [2023-08-29 02:51:55,901 INFO L134 LiptonReduction]: Checked pairs total: 159140 [2023-08-29 02:51:55,902 INFO L136 LiptonReduction]: Total number of compositions: 152 [2023-08-29 02:51:55,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:51:55,903 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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:51:55,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-29 02:51:55,905 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:51:55,905 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:51:55,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:51:55,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:51:55,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:51:55,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:51:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1560169834, now seen corresponding path program 1 times [2023-08-29 02:51:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:51:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447844606] [2023-08-29 02:51:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:51:55,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:51:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:51:55,934 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:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:51:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447844606] [2023-08-29 02:51:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447844606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:51:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:51:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:51:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471198195] [2023-08-29 02:51:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:51:55,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:51:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:51:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:51:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:51:55,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 417 [2023-08-29 02:51:55,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 139 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:55,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:51:55,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 417 [2023-08-29 02:51:55,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:08,304 INFO L130 PetriNetUnfolder]: 104640/183059 cut-off events. [2023-08-29 02:52:08,304 INFO L131 PetriNetUnfolder]: For 2142/2142 co-relation queries the response was YES. [2023-08-29 02:52:08,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329358 conditions, 183059 events. 104640/183059 cut-off events. For 2142/2142 co-relation queries the response was YES. Maximal size of possible extension queue 3668. Compared 1886889 event pairs, 67885 based on Foata normal form. 22867/188670 useless extension candidates. Maximal degree in co-relation 19344. Up to 144765 conditions per place. [2023-08-29 02:52:09,346 INFO L137 encePairwiseOnDemand]: 392/417 looper letters, 72 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2023-08-29 02:52:09,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 442 flow [2023-08-29 02:52:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2023-08-29 02:52:09,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.636290967226219 [2023-08-29 02:52:09,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 796 transitions. [2023-08-29 02:52:09,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 796 transitions. [2023-08-29 02:52:09,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:09,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 796 transitions. [2023-08-29 02:52:09,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:52:09,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:52:09,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:52:09,356 INFO L175 Difference]: Start difference. First operand has 122 places, 139 transitions, 308 flow. Second operand 3 states and 796 transitions. [2023-08-29 02:52:09,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 442 flow [2023-08-29 02:52:09,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 132 transitions, 442 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:52:09,358 INFO L231 Difference]: Finished difference. Result has 124 places, 118 transitions, 276 flow [2023-08-29 02:52:09,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=124, PETRI_TRANSITIONS=118} [2023-08-29 02:52:09,359 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 2 predicate places. [2023-08-29 02:52:09,359 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 118 transitions, 276 flow [2023-08-29 02:52:09,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:52:09,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:09,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 02:52:09,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 02:52:09,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:52:09,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1152909769, now seen corresponding path program 1 times [2023-08-29 02:52:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999823645] [2023-08-29 02:52:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:09,384 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:52:09,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:09,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999823645] [2023-08-29 02:52:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999823645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:09,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:52:09,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:52:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505137983] [2023-08-29 02:52:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:09,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:52:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:52:09,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:52:09,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 417 [2023-08-29 02:52:09,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 118 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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:52:09,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:09,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 417 [2023-08-29 02:52:09,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:39,138 INFO L130 PetriNetUnfolder]: 281861/466394 cut-off events. [2023-08-29 02:52:39,138 INFO L131 PetriNetUnfolder]: For 10696/10696 co-relation queries the response was YES. [2023-08-29 02:52:40,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868188 conditions, 466394 events. 281861/466394 cut-off events. For 10696/10696 co-relation queries the response was YES. Maximal size of possible extension queue 8612. Compared 4979992 event pairs, 104520 based on Foata normal form. 0/421441 useless extension candidates. Maximal degree in co-relation 868069. Up to 238006 conditions per place. [2023-08-29 02:52:42,229 INFO L137 encePairwiseOnDemand]: 407/417 looper letters, 124 selfloop transitions, 7 changer transitions 0/181 dead transitions. [2023-08-29 02:52:42,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 181 transitions, 692 flow [2023-08-29 02:52:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:52:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:52:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2023-08-29 02:52:42,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.645083932853717 [2023-08-29 02:52:42,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2023-08-29 02:52:42,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2023-08-29 02:52:42,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:52:42,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2023-08-29 02:52:42,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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:52:42,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:52:42,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:52:42,239 INFO L175 Difference]: Start difference. First operand has 124 places, 118 transitions, 276 flow. Second operand 3 states and 807 transitions. [2023-08-29 02:52:42,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 181 transitions, 692 flow [2023-08-29 02:52:42,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 181 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:52:42,248 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 336 flow [2023-08-29 02:52:42,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2023-08-29 02:52:42,249 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 5 predicate places. [2023-08-29 02:52:42,249 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 336 flow [2023-08-29 02:52:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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:52:42,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:52:42,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:52:42,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 02:52:42,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:52:42,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:52:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash -606706377, now seen corresponding path program 1 times [2023-08-29 02:52:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:52:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516340123] [2023-08-29 02:52:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:42,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:52:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:42,277 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:52:42,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:52:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516340123] [2023-08-29 02:52:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516340123] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:52:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374050012] [2023-08-29 02:52:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:52:42,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:52:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:52:42,279 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:52:42,281 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:52:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:52:42,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:52:42,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:52:42,366 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:52:42,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:52:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374050012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:52:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:52:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:52:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091499867] [2023-08-29 02:52:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:52:42,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:52:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:52:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:52:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:52:42,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 417 [2023-08-29 02:52:42,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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:52:42,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:52:42,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 417 [2023-08-29 02:52:42,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:52:45,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 35#L950-1true, 133#L963-14true, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:45,382 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 02:52:45,382 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:52:45,383 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:52:45,383 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:52:45,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 35#L950-1true, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:45,695 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,695 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,695 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,695 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 35#L950-1true, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:45,696 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,696 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,696 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:45,696 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:52:46,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 101#L-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:46,381 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 02:52:46,381 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:52:46,381 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:52:46,381 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:52:46,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 133#L963-14true, 100#L950-2true, 68#L942-29true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:46,704 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,704 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,704 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,704 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,718 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, 101#L-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:46,718 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,718 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,718 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,718 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,719 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 101#L-1true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:46,719 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,719 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,719 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:46,719 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:52:47,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 68#L942-29true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:47,313 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,313 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,314 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,314 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 68#L942-29true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:47,314 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,314 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,314 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:47,314 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:52:48,311 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, 11#L942-3true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:48,312 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:52:48,312 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:52:48,312 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:52:48,312 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:52:48,738 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 11#L942-3true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:48,738 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,738 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,743 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,743 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 11#L942-3true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:48,743 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,743 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,744 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:48,744 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:52:50,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 142#L942-8true, 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:50,681 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:52:50,682 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:50,682 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:50,682 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:52:51,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 140#L942-11true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:51,477 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,477 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,477 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,477 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, 75#L963-9true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 142#L942-8true, 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:51,478 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 124#ULTIMATE.startEXITtrue, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 142#L942-8true, 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:51,479 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,479 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,479 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:51,479 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:52:52,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, 195#L942-27true, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:52,034 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,034 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,035 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,035 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,035 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, 140#L942-11true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:52,035 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,035 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,035 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,035 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,043 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, 140#L942-11true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:52,044 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,044 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,044 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,044 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:52:52,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, 195#L942-27true, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:52,831 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,831 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,831 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,831 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, 195#L942-27true, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:52,845 INFO L383 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,845 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,845 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:52,845 INFO L386 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-29 02:52:53,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [65#L942-17true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:53,680 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-29 02:52:53,680 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-29 02:52:53,680 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-29 02:52:53,680 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-29 02:52:53,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [65#L942-17true, 75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:53,742 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, 65#L942-17true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:53,742 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,743 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:53,743 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:52:55,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 47#L942-21true, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:55,930 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:52:55,931 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:55,931 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:55,931 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:52:55,994 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 47#L942-21true, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:55,995 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,995 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,995 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,995 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,995 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 47#L942-21true, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:55,995 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,996 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,996 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:55,996 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:52:57,327 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 235#L942-25true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:57,327 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:52:57,327 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:57,327 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:57,327 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:52:57,406 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 235#L942-25true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:57,406 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,406 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,406 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,406 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,407 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 235#L942-25true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:57,407 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,407 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,407 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:57,407 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:58,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, 87#L942-28true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:58,265 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:52:58,265 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:58,265 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:58,265 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:52:59,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 87#L942-28true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:59,148 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,148 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,148 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,148 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,149 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 87#L942-28true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:59,149 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,149 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,149 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,149 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,150 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 28#t_funEXITtrue, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:59,150 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,150 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,150 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,150 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:52:59,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [75#L963-9true, 260#true, Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 28#t_funEXITtrue, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:59,743 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,743 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, Black: 254#true, 124#ULTIMATE.startEXITtrue, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 28#t_funEXITtrue, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:52:59,744 INFO L383 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,744 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,744 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:52:59,744 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-29 02:53:00,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, t_funThread1of3ForFork0NotInUse, Black: 254#true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 218#L963-10true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:53:00,686 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-29 02:53:00,686 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 02:53:00,686 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 02:53:00,686 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-29 02:53:02,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, t_funThread1of3ForFork0NotInUse, Black: 254#true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 133#L963-14true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:53:02,133 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-29 02:53:02,133 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:53:02,133 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:53:02,133 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-08-29 02:53:02,882 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, 75#L963-9true, t_funThread1of3ForFork0NotInUse, Black: 254#true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:53:02,882 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,882 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,882 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,882 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,883 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][62], [260#true, t_funThread1of3ForFork0NotInUse, Black: 254#true, 124#ULTIMATE.startEXITtrue, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 256#(= |#race~f~0| 0)]) [2023-08-29 02:53:02,883 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,883 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,883 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 02:53:02,883 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-08-29 02:53:14,072 INFO L130 PetriNetUnfolder]: 267338/461036 cut-off events. [2023-08-29 02:53:14,073 INFO L131 PetriNetUnfolder]: For 56152/56165 co-relation queries the response was YES. [2023-08-29 02:53:15,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886350 conditions, 461036 events. 267338/461036 cut-off events. For 56152/56165 co-relation queries the response was YES. Maximal size of possible extension queue 8940. Compared 5156910 event pairs, 225139 based on Foata normal form. 3/415846 useless extension candidates. Maximal degree in co-relation 267022. Up to 352578 conditions per place. [2023-08-29 02:53:17,748 INFO L137 encePairwiseOnDemand]: 411/417 looper letters, 101 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2023-08-29 02:53:17,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 168 transitions, 660 flow [2023-08-29 02:53:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:53:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:53:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2023-08-29 02:53:17,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6243005595523581 [2023-08-29 02:53:17,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 781 transitions. [2023-08-29 02:53:17,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 781 transitions. [2023-08-29 02:53:17,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:53:17,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 781 transitions. [2023-08-29 02:53:17,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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:53:17,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:17,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:17,773 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 336 flow. Second operand 3 states and 781 transitions. [2023-08-29 02:53:17,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 168 transitions, 660 flow [2023-08-29 02:53:18,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 168 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:53:18,297 INFO L231 Difference]: Finished difference. Result has 128 places, 132 transitions, 391 flow [2023-08-29 02:53:18,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=128, PETRI_TRANSITIONS=132} [2023-08-29 02:53:18,298 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 6 predicate places. [2023-08-29 02:53:18,298 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 132 transitions, 391 flow [2023-08-29 02:53:18,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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:53:18,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:53:18,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:53:18,303 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:53:18,505 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,SelfDestructingSolverStorable21 [2023-08-29 02:53:18,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:53:18,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:53:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2079755673, now seen corresponding path program 1 times [2023-08-29 02:53:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:53:18,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348300992] [2023-08-29 02:53:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:53:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:18,570 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:53:18,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:53:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348300992] [2023-08-29 02:53:18,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348300992] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:53:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358177542] [2023-08-29 02:53:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:18,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:53:18,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:53:18,585 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:53:18,637 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:53:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:18,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:53:18,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:53:18,733 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:53:18,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:53:18,747 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:53:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358177542] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:53:18,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:53:18,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:53:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326233039] [2023-08-29 02:53:18,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:53:18,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:53:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:53:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:53:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:53:18,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 417 [2023-08-29 02:53:18,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 232.85714285714286) internal successors, (1630), 7 states have internal predecessors, (1630), 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:53:18,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:53:18,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 417 [2023-08-29 02:53:18,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:53:18,981 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 101#L-1true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:18,982 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,982 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,982 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,982 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 106#L950-1true, 101#L-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:18,983 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,983 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,984 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 02:53:18,984 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 02:53:19,005 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 68#L942-29true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 219#L950-1true]) [2023-08-29 02:53:19,005 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,005 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,006 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,006 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 101#L-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,008 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,008 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,008 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,008 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 106#L950-1true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 68#L942-29true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,008 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,009 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,013 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,013 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 02:53:19,053 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 68#L942-29true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,053 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 02:53:19,054 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 02:53:19,054 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 02:53:19,054 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 02:53:19,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 254#true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 11#L942-3true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 219#L950-1true]) [2023-08-29 02:53:19,115 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,115 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,115 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,115 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,116 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 106#L950-1true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 11#L942-3true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,116 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,116 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,116 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,116 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 02:53:19,176 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, 11#L942-3true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,176 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 02:53:19,176 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 02:53:19,177 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 02:53:19,177 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 02:53:19,317 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 254#true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 142#L942-8true]) [2023-08-29 02:53:19,318 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,320 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, 106#L950-1true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 142#L942-8true]) [2023-08-29 02:53:19,320 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,320 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,320 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,320 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 02:53:19,372 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, 140#L942-11true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 219#L950-1true]) [2023-08-29 02:53:19,372 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,373 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,373 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,373 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 142#L942-8true]) [2023-08-29 02:53:19,378 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,378 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, 106#L950-1true, 140#L942-11true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,379 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,380 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,380 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,380 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 02:53:19,425 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 195#L942-27true, t_funThread3of3ForFork0InUse, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,425 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,425 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,426 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,426 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,428 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 254#true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 140#L942-11true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,428 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,428 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,428 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,428 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, 106#L950-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, 195#L942-27true, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,429 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,429 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,429 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,430 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:53:19,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, 195#L942-27true, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,480 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 02:53:19,480 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:53:19,480 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:53:19,480 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:53:19,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 65#L942-17true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,534 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,534 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,534 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,534 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 65#L942-17true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 106#L950-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,538 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:53:19,593 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 65#L942-17true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,594 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:53:19,594 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:53:19,594 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:53:19,594 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:53:19,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 47#L942-21true, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,886 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,886 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,886 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,886 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 106#L950-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 47#L942-21true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,891 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,891 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,891 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,891 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-29 02:53:19,944 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 47#L942-21true, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:19,945 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:53:19,945 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:53:19,945 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:53:19,945 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:53:19,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, t_funThread1of3ForFork0InUse, 235#L942-25true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:20,000 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,000 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,000 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,000 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,005 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, 106#L950-1true, t_funThread1of3ForFork0InUse, 235#L942-25true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:20,006 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,006 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,006 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,006 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:53:20,060 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 8#L-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 219#L950-1true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 87#L942-28true]) [2023-08-29 02:53:20,060 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,060 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,060 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,060 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,064 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, t_funThread1of3ForFork0InUse, 235#L942-25true, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:20,064 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,064 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,064 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,065 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 106#L950-1true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 87#L942-28true]) [2023-08-29 02:53:20,067 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,067 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,067 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,067 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:53:20,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1512] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_578| |v_~#fm~0.base_159| (store (select |v_#pthreadsMutex_578| |v_~#fm~0.base_159|) |v_~#fm~0.offset_159| 0)) |v_#pthreadsMutex_577|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_578|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_577|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_159|, ~#fm~0.offset=|v_~#fm~0.offset_159|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][54], [260#true, 30#L956-7true, Black: 254#true, 8#L-1true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 28#t_funEXITtrue, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 219#L950-1true]) [2023-08-29 02:53:20,121 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,121 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,121 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,121 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,126 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 254#true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0), 87#L942-28true]) [2023-08-29 02:53:20,126 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,128 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 254#true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 106#L950-1true, t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 28#t_funEXITtrue, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:20,129 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,129 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,129 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,129 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:53:20,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1572] L951-->L941: Formula: (and (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|) (= (store |v_#pthreadsMutex_686| |v_~#fm~0.base_165| (store (select |v_#pthreadsMutex_686| |v_~#fm~0.base_165|) |v_~#fm~0.offset_165| 0)) |v_#pthreadsMutex_685|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_686|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_165|, ~#fm~0.offset=|v_~#fm~0.offset_165|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_685|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_165|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_165|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [260#true, 30#L956-7true, Black: 288#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread1of3ForFork0InUse, 156#L941true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 28#t_funEXITtrue, 100#L950-2true, Black: 251#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-08-29 02:53:20,187 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:53:20,187 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:53:20,188 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:53:20,188 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:53:21,739 INFO L130 PetriNetUnfolder]: 23109/44962 cut-off events. [2023-08-29 02:53:21,739 INFO L131 PetriNetUnfolder]: For 11441/11556 co-relation queries the response was YES. [2023-08-29 02:53:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86726 conditions, 44962 events. 23109/44962 cut-off events. For 11441/11556 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 431298 event pairs, 3171 based on Foata normal form. 3533/46503 useless extension candidates. Maximal degree in co-relation 86717. Up to 23682 conditions per place. [2023-08-29 02:53:22,052 INFO L137 encePairwiseOnDemand]: 414/417 looper letters, 122 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2023-08-29 02:53:22,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 685 flow [2023-08-29 02:53:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:53:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:53:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2023-08-29 02:53:22,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6019184652278178 [2023-08-29 02:53:22,069 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1506 transitions. [2023-08-29 02:53:22,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1506 transitions. [2023-08-29 02:53:22,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:53:22,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1506 transitions. [2023-08-29 02:53:22,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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:53:22,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 417.0) internal successors, (2919), 7 states have internal predecessors, (2919), 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:53:22,093 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 417.0) internal successors, (2919), 7 states have internal predecessors, (2919), 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:53:22,093 INFO L175 Difference]: Start difference. First operand has 128 places, 132 transitions, 391 flow. Second operand 6 states and 1506 transitions. [2023-08-29 02:53:22,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 685 flow [2023-08-29 02:53:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 177 transitions, 657 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-29 02:53:22,100 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 243 flow [2023-08-29 02:53:22,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2023-08-29 02:53:22,101 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2023-08-29 02:53:22,101 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 243 flow [2023-08-29 02:53:22,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.85714285714286) internal successors, (1630), 7 states have internal predecessors, (1630), 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:53:22,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:53:22,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:53:22,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 02:53:22,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:53:22,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:53:22,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:53:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1429023500, now seen corresponding path program 1 times [2023-08-29 02:53:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:53:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917320853] [2023-08-29 02:53:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:53:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:22,346 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:53:22,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:53:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917320853] [2023-08-29 02:53:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917320853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:53:22,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:53:22,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:53:22,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269407884] [2023-08-29 02:53:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:53:22,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:53:22,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:53:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:53:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:53:22,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 417 [2023-08-29 02:53:22,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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:53:22,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:53:22,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 417 [2023-08-29 02:53:22,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:53:30,030 INFO L130 PetriNetUnfolder]: 79291/127975 cut-off events. [2023-08-29 02:53:30,031 INFO L131 PetriNetUnfolder]: For 37394/37394 co-relation queries the response was YES. [2023-08-29 02:53:30,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268074 conditions, 127975 events. 79291/127975 cut-off events. For 37394/37394 co-relation queries the response was YES. Maximal size of possible extension queue 2464. Compared 1116479 event pairs, 38158 based on Foata normal form. 0/122689 useless extension candidates. Maximal degree in co-relation 268065. Up to 63630 conditions per place. [2023-08-29 02:53:30,786 INFO L137 encePairwiseOnDemand]: 393/417 looper letters, 99 selfloop transitions, 18 changer transitions 0/151 dead transitions. [2023-08-29 02:53:30,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 151 transitions, 609 flow [2023-08-29 02:53:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:53:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:53:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2023-08-29 02:53:30,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5931254996003198 [2023-08-29 02:53:30,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2023-08-29 02:53:30,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2023-08-29 02:53:30,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:53:30,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2023-08-29 02:53:30,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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:53:30,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:30,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:30,794 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 243 flow. Second operand 3 states and 742 transitions. [2023-08-29 02:53:30,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 151 transitions, 609 flow [2023-08-29 02:53:30,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 594 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-29 02:53:30,807 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 390 flow [2023-08-29 02:53:30,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2023-08-29 02:53:30,808 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2023-08-29 02:53:30,808 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 390 flow [2023-08-29 02:53:30,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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:53:30,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:53:30,808 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:53:30,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 02:53:30,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:53:30,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:53:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1475689064, now seen corresponding path program 1 times [2023-08-29 02:53:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:53:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604535422] [2023-08-29 02:53:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:53:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:30,840 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:53:30,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:53:30,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604535422] [2023-08-29 02:53:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604535422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:53:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:53:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:53:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743472478] [2023-08-29 02:53:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:53:30,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:53:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:53:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:53:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:53:30,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 417 [2023-08-29 02:53:30,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:53:30,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:53:30,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 417 [2023-08-29 02:53:30,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:53:37,867 INFO L130 PetriNetUnfolder]: 63240/106952 cut-off events. [2023-08-29 02:53:37,868 INFO L131 PetriNetUnfolder]: For 55663/56590 co-relation queries the response was YES. [2023-08-29 02:53:38,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254951 conditions, 106952 events. 63240/106952 cut-off events. For 55663/56590 co-relation queries the response was YES. Maximal size of possible extension queue 2299. Compared 984438 event pairs, 47456 based on Foata normal form. 0/100923 useless extension candidates. Maximal degree in co-relation 254942. Up to 83978 conditions per place. [2023-08-29 02:53:38,531 INFO L137 encePairwiseOnDemand]: 406/417 looper letters, 88 selfloop transitions, 19 changer transitions 0/158 dead transitions. [2023-08-29 02:53:38,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 158 transitions, 754 flow [2023-08-29 02:53:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:53:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:53:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-29 02:53:38,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.586730615507594 [2023-08-29 02:53:38,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-29 02:53:38,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-29 02:53:38,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:53:38,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-29 02:53:38,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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:53:38,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:38,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:38,538 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 390 flow. Second operand 3 states and 734 transitions. [2023-08-29 02:53:38,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 158 transitions, 754 flow [2023-08-29 02:53:38,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 158 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:53:38,602 INFO L231 Difference]: Finished difference. Result has 111 places, 132 transitions, 513 flow [2023-08-29 02:53:38,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=111, PETRI_TRANSITIONS=132} [2023-08-29 02:53:38,603 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -11 predicate places. [2023-08-29 02:53:38,603 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 132 transitions, 513 flow [2023-08-29 02:53:38,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:53:38,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:53:38,603 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:53:38,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 02:53:38,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:53:38,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:53:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 968296036, now seen corresponding path program 1 times [2023-08-29 02:53:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:53:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757975184] [2023-08-29 02:53:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:53:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:53:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:53:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757975184] [2023-08-29 02:53:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757975184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:53:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:53:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:53:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412162169] [2023-08-29 02:53:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:53:38,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:53:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:53:38,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:53:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:53:38,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 417 [2023-08-29 02:53:38,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 132 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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:53:38,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:53:38,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 417 [2023-08-29 02:53:38,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:53:46,567 INFO L130 PetriNetUnfolder]: 69626/116644 cut-off events. [2023-08-29 02:53:46,568 INFO L131 PetriNetUnfolder]: For 72916/75445 co-relation queries the response was YES. [2023-08-29 02:53:46,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284970 conditions, 116644 events. 69626/116644 cut-off events. For 72916/75445 co-relation queries the response was YES. Maximal size of possible extension queue 2490. Compared 1075207 event pairs, 46509 based on Foata normal form. 123/108827 useless extension candidates. Maximal degree in co-relation 284960. Up to 86941 conditions per place. [2023-08-29 02:53:47,317 INFO L137 encePairwiseOnDemand]: 405/417 looper letters, 103 selfloop transitions, 28 changer transitions 0/182 dead transitions. [2023-08-29 02:53:47,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 182 transitions, 975 flow [2023-08-29 02:53:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:53:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:53:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2023-08-29 02:53:47,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5875299760191847 [2023-08-29 02:53:47,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 735 transitions. [2023-08-29 02:53:47,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 735 transitions. [2023-08-29 02:53:47,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:53:47,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 735 transitions. [2023-08-29 02:53:47,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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:53:47,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:47,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:47,322 INFO L175 Difference]: Start difference. First operand has 111 places, 132 transitions, 513 flow. Second operand 3 states and 735 transitions. [2023-08-29 02:53:47,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 182 transitions, 975 flow [2023-08-29 02:53:48,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 182 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:53:48,535 INFO L231 Difference]: Finished difference. Result has 114 places, 156 transitions, 780 flow [2023-08-29 02:53:48,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=114, PETRI_TRANSITIONS=156} [2023-08-29 02:53:48,536 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -8 predicate places. [2023-08-29 02:53:48,536 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 156 transitions, 780 flow [2023-08-29 02:53:48,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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:53:48,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:53:48,536 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:53:48,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 02:53:48,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:53:48,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:53:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash 620724668, now seen corresponding path program 1 times [2023-08-29 02:53:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:53:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239123176] [2023-08-29 02:53:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:53:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 02:53:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:53:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239123176] [2023-08-29 02:53:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239123176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:53:48,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:53:48,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:53:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962029182] [2023-08-29 02:53:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:53:48,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:53:48,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:53:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:53:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:53:48,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 417 [2023-08-29 02:53:48,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 156 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:53:48,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:53:48,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 417 [2023-08-29 02:53:48,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:53:57,267 INFO L130 PetriNetUnfolder]: 73053/121913 cut-off events. [2023-08-29 02:53:57,268 INFO L131 PetriNetUnfolder]: For 133772/138806 co-relation queries the response was YES. [2023-08-29 02:53:57,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330628 conditions, 121913 events. 73053/121913 cut-off events. For 133772/138806 co-relation queries the response was YES. Maximal size of possible extension queue 2627. Compared 1124636 event pairs, 49679 based on Foata normal form. 255/113388 useless extension candidates. Maximal degree in co-relation 330617. Up to 96963 conditions per place. [2023-08-29 02:53:58,086 INFO L137 encePairwiseOnDemand]: 406/417 looper letters, 119 selfloop transitions, 31 changer transitions 0/201 dead transitions. [2023-08-29 02:53:58,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 201 transitions, 1302 flow [2023-08-29 02:53:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:53:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:53:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2023-08-29 02:53:58,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5843325339728217 [2023-08-29 02:53:58,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 731 transitions. [2023-08-29 02:53:58,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 731 transitions. [2023-08-29 02:53:58,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:53:58,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 731 transitions. [2023-08-29 02:53:58,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:53:58,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:58,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:53:58,090 INFO L175 Difference]: Start difference. First operand has 114 places, 156 transitions, 780 flow. Second operand 3 states and 731 transitions. [2023-08-29 02:53:58,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 201 transitions, 1302 flow [2023-08-29 02:53:59,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 201 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:53:59,215 INFO L231 Difference]: Finished difference. Result has 115 places, 179 transitions, 1011 flow [2023-08-29 02:53:59,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1011, PETRI_PLACES=115, PETRI_TRANSITIONS=179} [2023-08-29 02:53:59,215 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -7 predicate places. [2023-08-29 02:53:59,215 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 179 transitions, 1011 flow [2023-08-29 02:53:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:53:59,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:53:59,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:53:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 02:53:59,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:53:59,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:53:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash -915319120, now seen corresponding path program 1 times [2023-08-29 02:53:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:53:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975131038] [2023-08-29 02:53:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:53:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:53:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:53:59,235 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:53:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:53:59,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975131038] [2023-08-29 02:53:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975131038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:53:59,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:53:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:53:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576839218] [2023-08-29 02:53:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:53:59,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:53:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:53:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:53:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:53:59,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 417 [2023-08-29 02:53:59,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 179 transitions, 1011 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:53:59,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:53:59,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 417 [2023-08-29 02:53:59,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:54:09,477 INFO L130 PetriNetUnfolder]: 76957/127794 cut-off events. [2023-08-29 02:54:09,477 INFO L131 PetriNetUnfolder]: For 199608/206877 co-relation queries the response was YES. [2023-08-29 02:54:10,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366812 conditions, 127794 events. 76957/127794 cut-off events. For 199608/206877 co-relation queries the response was YES. Maximal size of possible extension queue 2699. Compared 1177042 event pairs, 50283 based on Foata normal form. 360/118489 useless extension candidates. Maximal degree in co-relation 366800. Up to 101440 conditions per place. [2023-08-29 02:54:10,781 INFO L137 encePairwiseOnDemand]: 406/417 looper letters, 147 selfloop transitions, 31 changer transitions 0/229 dead transitions. [2023-08-29 02:54:10,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 229 transitions, 1639 flow [2023-08-29 02:54:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:54:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:54:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-29 02:54:10,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.586730615507594 [2023-08-29 02:54:10,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-29 02:54:10,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-29 02:54:10,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:54:10,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-29 02:54:10,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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:54:10,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:54:10,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:54:10,785 INFO L175 Difference]: Start difference. First operand has 115 places, 179 transitions, 1011 flow. Second operand 3 states and 734 transitions. [2023-08-29 02:54:10,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 229 transitions, 1639 flow [2023-08-29 02:54:11,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 229 transitions, 1604 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:54:11,106 INFO L231 Difference]: Finished difference. Result has 117 places, 202 transitions, 1311 flow [2023-08-29 02:54:11,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=117, PETRI_TRANSITIONS=202} [2023-08-29 02:54:11,108 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -5 predicate places. [2023-08-29 02:54:11,108 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 202 transitions, 1311 flow [2023-08-29 02:54:11,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:54:11,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:11,108 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:54:11,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 02:54:11,109 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:54:11,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 890175368, now seen corresponding path program 1 times [2023-08-29 02:54:11,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:11,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218415457] [2023-08-29 02:54:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:54:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:54:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:54:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218415457] [2023-08-29 02:54:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218415457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:54:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:54:11,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:54:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943948351] [2023-08-29 02:54:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:54:11,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:54:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:54:11,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:54:11,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:54:11,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 417 [2023-08-29 02:54:11,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 202 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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:54:11,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:54:11,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 417 [2023-08-29 02:54:11,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:54:24,701 INFO L130 PetriNetUnfolder]: 83218/137682 cut-off events. [2023-08-29 02:54:24,702 INFO L131 PetriNetUnfolder]: For 299320/309595 co-relation queries the response was YES. [2023-08-29 02:54:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420859 conditions, 137682 events. 83218/137682 cut-off events. For 299320/309595 co-relation queries the response was YES. Maximal size of possible extension queue 2845. Compared 1268264 event pairs, 48764 based on Foata normal form. 396/127336 useless extension candidates. Maximal degree in co-relation 420846. Up to 103533 conditions per place. [2023-08-29 02:54:25,754 INFO L137 encePairwiseOnDemand]: 405/417 looper letters, 171 selfloop transitions, 44 changer transitions 0/266 dead transitions. [2023-08-29 02:54:25,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 266 transitions, 2163 flow [2023-08-29 02:54:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:54:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:54:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2023-08-29 02:54:25,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5875299760191847 [2023-08-29 02:54:25,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 735 transitions. [2023-08-29 02:54:25,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 735 transitions. [2023-08-29 02:54:25,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:54:25,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 735 transitions. [2023-08-29 02:54:25,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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:54:25,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:54:25,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:54:25,769 INFO L175 Difference]: Start difference. First operand has 117 places, 202 transitions, 1311 flow. Second operand 3 states and 735 transitions. [2023-08-29 02:54:25,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 266 transitions, 2163 flow [2023-08-29 02:54:28,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 266 transitions, 2065 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-08-29 02:54:28,265 INFO L231 Difference]: Finished difference. Result has 120 places, 238 transitions, 1806 flow [2023-08-29 02:54:28,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1806, PETRI_PLACES=120, PETRI_TRANSITIONS=238} [2023-08-29 02:54:28,266 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -2 predicate places. [2023-08-29 02:54:28,266 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 238 transitions, 1806 flow [2023-08-29 02:54:28,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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:54:28,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:28,266 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:54:28,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 02:54:28,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:54:28,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1793974848, now seen corresponding path program 1 times [2023-08-29 02:54:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124901517] [2023-08-29 02:54:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:54:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:54:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:54:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124901517] [2023-08-29 02:54:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124901517] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:54:28,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:54:28,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 02:54:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433474180] [2023-08-29 02:54:28,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:54:28,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 02:54:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:54:28,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 02:54:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 02:54:28,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 417 [2023-08-29 02:54:28,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 238 transitions, 1806 flow. Second operand has 4 states, 4 states have (on average 224.75) internal successors, (899), 4 states have internal predecessors, (899), 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:54:28,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:54:28,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 417 [2023-08-29 02:54:28,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:54:40,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1461] L942-20-->L942-22: Formula: (= |v_t_funThread3of3ForFork0_good_#t~nondet43#1_15| |v_#race~global~0_72|) InVars {} OutVars{#race~global~0=|v_#race~global~0_72|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_15|} AuxVars[] AssignedVars[#race~global~0, t_funThread3of3ForFork0_good_#t~nondet43#1][153], [Black: 383#(= |#race~global~0| |t_funThread1of3ForFork0_good_#t~nondet43#1|), Black: 254#true, 164#t_funEXITtrue, Black: 388#(= |#race~global~0| |t_funThread2of3ForFork0_good_#t~nondet43#1|), 47#L942-21true, 394#(not (= |~#gm~0.base| |~#__global_lock~0.base|)), 386#true, 109#L942-22true, Black: 361#(= |#race~global~0| 0), 348#(< |ULTIMATE.start_main_~i~0#1| 9999), 260#true, Black: 367#(= |#race~global~0| |t_funThread1of3ForFork0_good_#t~nondet40#1|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 372#(= |#race~global~0| |t_funThread2of3ForFork0_good_#t~nondet40#1|), Black: 378#(= |#race~global~0| |t_funThread3of3ForFork0_good_#t~nondet40#1|), 228#L956-8true]) [2023-08-29 02:54:40,646 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2023-08-29 02:54:40,646 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-08-29 02:54:40,646 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-08-29 02:54:40,646 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-08-29 02:54:40,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1461] L942-20-->L942-22: Formula: (= |v_t_funThread3of3ForFork0_good_#t~nondet43#1_15| |v_#race~global~0_72|) InVars {} OutVars{#race~global~0=|v_#race~global~0_72|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_15|} AuxVars[] AssignedVars[#race~global~0, t_funThread3of3ForFork0_good_#t~nondet43#1][153], [Black: 383#(= |#race~global~0| |t_funThread1of3ForFork0_good_#t~nondet43#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), 164#t_funEXITtrue, Black: 388#(= |#race~global~0| |t_funThread2of3ForFork0_good_#t~nondet43#1|), 47#L942-21true, 394#(not (= |~#gm~0.base| |~#__global_lock~0.base|)), 109#L942-22true, Black: 361#(= |#race~global~0| 0), 386#true, 260#true, Black: 367#(= |#race~global~0| |t_funThread1of3ForFork0_good_#t~nondet40#1|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 372#(= |#race~global~0| |t_funThread2of3ForFork0_good_#t~nondet40#1|), Black: 378#(= |#race~global~0| |t_funThread3of3ForFork0_good_#t~nondet40#1|), 89#L956-13true]) [2023-08-29 02:54:40,723 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-29 02:54:40,723 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 02:54:40,723 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 02:54:40,724 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-29 02:54:40,790 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1461] L942-20-->L942-22: Formula: (= |v_t_funThread3of3ForFork0_good_#t~nondet43#1_15| |v_#race~global~0_72|) InVars {} OutVars{#race~global~0=|v_#race~global~0_72|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_15|} AuxVars[] AssignedVars[#race~global~0, t_funThread3of3ForFork0_good_#t~nondet43#1][153], [30#L956-7true, Black: 383#(= |#race~global~0| |t_funThread1of3ForFork0_good_#t~nondet43#1|), Black: 254#true, 338#(< |ULTIMATE.start_main_~i~0#1| 10000), Black: 388#(= |#race~global~0| |t_funThread2of3ForFork0_good_#t~nondet43#1|), 164#t_funEXITtrue, 394#(not (= |~#gm~0.base| |~#__global_lock~0.base|)), 47#L942-21true, Black: 361#(= |#race~global~0| 0), 109#L942-22true, 386#true, 260#true, Black: 367#(= |#race~global~0| |t_funThread1of3ForFork0_good_#t~nondet40#1|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, Black: 372#(= |#race~global~0| |t_funThread2of3ForFork0_good_#t~nondet40#1|), t_funThread3of3ForFork0InUse, Black: 378#(= |#race~global~0| |t_funThread3of3ForFork0_good_#t~nondet40#1|)]) [2023-08-29 02:54:40,790 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-29 02:54:40,791 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 02:54:40,791 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 02:54:40,791 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-29 02:54:40,996 INFO L130 PetriNetUnfolder]: 82136/144382 cut-off events. [2023-08-29 02:54:40,996 INFO L131 PetriNetUnfolder]: For 418781/438425 co-relation queries the response was YES. [2023-08-29 02:54:41,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460613 conditions, 144382 events. 82136/144382 cut-off events. For 418781/438425 co-relation queries the response was YES. Maximal size of possible extension queue 3223. Compared 1447487 event pairs, 22287 based on Foata normal form. 5739/140139 useless extension candidates. Maximal degree in co-relation 460599. Up to 79773 conditions per place. [2023-08-29 02:54:42,351 INFO L137 encePairwiseOnDemand]: 407/417 looper letters, 196 selfloop transitions, 10 changer transitions 0/324 dead transitions. [2023-08-29 02:54:42,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 324 transitions, 2836 flow [2023-08-29 02:54:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:54:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:54:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 968 transitions. [2023-08-29 02:54:42,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.580335731414868 [2023-08-29 02:54:42,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 968 transitions. [2023-08-29 02:54:42,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 968 transitions. [2023-08-29 02:54:42,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:54:42,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 968 transitions. [2023-08-29 02:54:42,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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:54:42,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 417.0) internal successors, (2085), 5 states have internal predecessors, (2085), 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:54:42,358 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 417.0) internal successors, (2085), 5 states have internal predecessors, (2085), 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:54:42,358 INFO L175 Difference]: Start difference. First operand has 120 places, 238 transitions, 1806 flow. Second operand 4 states and 968 transitions. [2023-08-29 02:54:42,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 324 transitions, 2836 flow [2023-08-29 02:54:45,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 324 transitions, 2636 flow, removed 40 selfloop flow, removed 2 redundant places. [2023-08-29 02:54:45,291 INFO L231 Difference]: Finished difference. Result has 122 places, 244 transitions, 1703 flow [2023-08-29 02:54:45,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1703, PETRI_PLACES=122, PETRI_TRANSITIONS=244} [2023-08-29 02:54:45,296 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2023-08-29 02:54:45,296 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 244 transitions, 1703 flow [2023-08-29 02:54:45,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 224.75) internal successors, (899), 4 states have internal predecessors, (899), 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:54:45,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:45,313 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:54:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-29 02:54:45,313 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:54:45,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1380205120, now seen corresponding path program 2 times [2023-08-29 02:54:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251311466] [2023-08-29 02:54:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:54:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:54:45,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:54:45,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251311466] [2023-08-29 02:54:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251311466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:54:45,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:54:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 02:54:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190637501] [2023-08-29 02:54:45,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:54:45,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 02:54:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:54:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 02:54:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:54:45,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 417 [2023-08-29 02:54:45,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 244 transitions, 1703 flow. Second operand has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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:54:45,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:54:45,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 417 [2023-08-29 02:54:45,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:54:46,809 INFO L130 PetriNetUnfolder]: 6616/14673 cut-off events. [2023-08-29 02:54:46,809 INFO L131 PetriNetUnfolder]: For 24338/24558 co-relation queries the response was YES. [2023-08-29 02:54:46,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41434 conditions, 14673 events. 6616/14673 cut-off events. For 24338/24558 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 128791 event pairs, 1769 based on Foata normal form. 1134/15512 useless extension candidates. Maximal degree in co-relation 41419. Up to 9231 conditions per place. [2023-08-29 02:54:46,891 INFO L137 encePairwiseOnDemand]: 410/417 looper letters, 55 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-29 02:54:46,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 105 transitions, 585 flow [2023-08-29 02:54:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:54:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:54:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 909 transitions. [2023-08-29 02:54:46,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5449640287769785 [2023-08-29 02:54:46,893 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 909 transitions. [2023-08-29 02:54:46,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 909 transitions. [2023-08-29 02:54:46,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:54:46,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 909 transitions. [2023-08-29 02:54:46,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 227.25) internal successors, (909), 4 states have internal predecessors, (909), 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:54:46,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 417.0) internal successors, (2085), 5 states have internal predecessors, (2085), 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:54:46,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 417.0) internal successors, (2085), 5 states have internal predecessors, (2085), 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:54:46,897 INFO L175 Difference]: Start difference. First operand has 122 places, 244 transitions, 1703 flow. Second operand 4 states and 909 transitions. [2023-08-29 02:54:46,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 105 transitions, 585 flow [2023-08-29 02:54:46,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 105 transitions, 444 flow, removed 48 selfloop flow, removed 13 redundant places. [2023-08-29 02:54:46,985 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 284 flow [2023-08-29 02:54:46,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2023-08-29 02:54:46,986 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -21 predicate places. [2023-08-29 02:54:46,986 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 284 flow [2023-08-29 02:54:46,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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:54:46,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:46,987 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:54:46,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-29 02:54:46,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-29 02:54:46,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash 97995701, now seen corresponding path program 1 times [2023-08-29 02:54:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:46,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591936789] [2023-08-29 02:54:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:54:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 02:54:47,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:54:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591936789] [2023-08-29 02:54:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591936789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:54:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:54:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:54:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610764389] [2023-08-29 02:54:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:54:47,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:54:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:54:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:54:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:54:47,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 417 [2023-08-29 02:54:47,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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:54:47,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:54:47,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 417 [2023-08-29 02:54:47,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:54:48,030 INFO L130 PetriNetUnfolder]: 7670/15726 cut-off events. [2023-08-29 02:54:48,031 INFO L131 PetriNetUnfolder]: For 5561/5638 co-relation queries the response was YES. [2023-08-29 02:54:48,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36744 conditions, 15726 events. 7670/15726 cut-off events. For 5561/5638 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 132315 event pairs, 6164 based on Foata normal form. 0/15405 useless extension candidates. Maximal degree in co-relation 36735. Up to 11805 conditions per place. [2023-08-29 02:54:48,074 INFO L137 encePairwiseOnDemand]: 414/417 looper letters, 0 selfloop transitions, 0 changer transitions 100/100 dead transitions. [2023-08-29 02:54:48,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 100 transitions, 446 flow [2023-08-29 02:54:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:54:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:54:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2023-08-29 02:54:48,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5651478816946442 [2023-08-29 02:54:48,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 707 transitions. [2023-08-29 02:54:48,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions. [2023-08-29 02:54:48,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:54:48,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions. [2023-08-29 02:54:48,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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:54:48,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:54:48,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 417.0) internal successors, (1668), 4 states have internal predecessors, (1668), 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:54:48,084 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 284 flow. Second operand 3 states and 707 transitions. [2023-08-29 02:54:48,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 100 transitions, 446 flow [2023-08-29 02:54:48,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 424 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 02:54:48,088 INFO L231 Difference]: Finished difference. Result has 99 places, 0 transitions, 0 flow [2023-08-29 02:54:48,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=99, PETRI_TRANSITIONS=0} [2023-08-29 02:54:48,089 INFO L281 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2023-08-29 02:54:48,089 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 0 transitions, 0 flow [2023-08-29 02:54:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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:54:48,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2023-08-29 02:54:48,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2023-08-29 02:54:48,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2023-08-29 02:54:48,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2023-08-29 02:54:48,091 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2023-08-29 02:54:48,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2023-08-29 02:54:48,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2023-08-29 02:54:48,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2023-08-29 02:54:48,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2023-08-29 02:54:48,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2023-08-29 02:54:48,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2023-08-29 02:54:48,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2023-08-29 02:54:48,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2023-08-29 02:54:48,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2023-08-29 02:54:48,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2023-08-29 02:54:48,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2023-08-29 02:54:48,096 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2023-08-29 02:54:48,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-29 02:54:48,097 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:54:48,105 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:54:48,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 265 transitions, 560 flow [2023-08-29 02:54:48,142 INFO L130 PetriNetUnfolder]: 50/518 cut-off events. [2023-08-29 02:54:48,142 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:54:48,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 518 events. 50/518 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2136 event pairs, 1 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 346. Up to 16 conditions per place. [2023-08-29 02:54:48,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 265 transitions, 560 flow [2023-08-29 02:54:48,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 265 transitions, 560 flow [2023-08-29 02:54:48,147 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:54:48,147 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 265 transitions, 560 flow [2023-08-29 02:54:48,147 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 265 transitions, 560 flow [2023-08-29 02:54:48,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 265 transitions, 560 flow [2023-08-29 02:54:48,193 INFO L130 PetriNetUnfolder]: 50/518 cut-off events. [2023-08-29 02:54:48,193 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:54:48,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 518 events. 50/518 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2136 event pairs, 1 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 346. Up to 16 conditions per place. [2023-08-29 02:54:48,210 INFO L119 LiptonReduction]: Number of co-enabled transitions 38940 [2023-08-29 02:54:50,686 INFO L134 LiptonReduction]: Checked pairs total: 158853 [2023-08-29 02:54:50,687 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-29 02:54:50,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:54:50,688 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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:54:50,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:54:50,695 INFO L130 PetriNetUnfolder]: 6/97 cut-off events. [2023-08-29 02:54:50,696 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-29 02:54:50,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:50,696 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 02:54:50,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:54:50,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1184688971, now seen corresponding path program 1 times [2023-08-29 02:54:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651549680] [2023-08-29 02:54:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:54:50,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:54:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:54:50,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:54:50,751 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:54:50,751 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:54:50,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-29 02:54:50,752 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:54:50,752 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:54:50,752 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:54:50,752 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 02:54:50,770 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 02:54:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 322 transitions, 688 flow [2023-08-29 02:54:50,851 INFO L130 PetriNetUnfolder]: 81/786 cut-off events. [2023-08-29 02:54:50,851 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:54:50,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 786 events. 81/786 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3559 event pairs, 6 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 538. Up to 32 conditions per place. [2023-08-29 02:54:50,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 322 transitions, 688 flow [2023-08-29 02:54:50,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 298 places, 322 transitions, 688 flow [2023-08-29 02:54:50,867 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:54:50,867 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 322 transitions, 688 flow [2023-08-29 02:54:50,867 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 322 transitions, 688 flow [2023-08-29 02:54:50,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 322 transitions, 688 flow [2023-08-29 02:54:50,944 INFO L130 PetriNetUnfolder]: 81/786 cut-off events. [2023-08-29 02:54:50,944 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:54:50,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 786 events. 81/786 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3559 event pairs, 6 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 538. Up to 32 conditions per place. [2023-08-29 02:54:50,978 INFO L119 LiptonReduction]: Number of co-enabled transitions 64680 [2023-08-29 02:54:53,632 INFO L134 LiptonReduction]: Checked pairs total: 308308 [2023-08-29 02:54:53,632 INFO L136 LiptonReduction]: Total number of compositions: 175 [2023-08-29 02:54:53,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:54:53,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;@78c37b34, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:54:53,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-08-29 02:54:53,634 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:54:53,634 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:54:53,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:54:53,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 02:54:53,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2023-08-29 02:54:53,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:54:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2062269197, now seen corresponding path program 1 times [2023-08-29 02:54:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:54:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415452871] [2023-08-29 02:54:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:54:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:54:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:54:53,671 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:54:53,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:54:53,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415452871] [2023-08-29 02:54:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415452871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:54:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:54:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:54:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723447145] [2023-08-29 02:54:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:54:53,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:54:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:54:53,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:54:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:54:53,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 497 [2023-08-29 02:54:53,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 176 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:54:53,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:54:53,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 497 [2023-08-29 02:54:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand