./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c --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/weaver/chl-file-item-trans.wvr.c -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 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b --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 03:24:22,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 03:24:22,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 03:24:22,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 03:24:22,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 03:24:22,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 03:24:22,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 03:24:22,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 03:24:22,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 03:24:22,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 03:24:22,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 03:24:22,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 03:24:22,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 03:24:22,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 03:24:22,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 03:24:22,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 03:24:22,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 03:24:22,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 03:24:22,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 03:24:22,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 03:24:22,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 03:24:22,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 03:24:22,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 03:24:22,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 03:24:22,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 03:24:22,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 03:24:22,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 03:24:22,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 03:24:22,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 03:24:22,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 03:24:22,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 03:24:22,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 03:24:22,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 03:24:22,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 03:24:22,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 03:24:22,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 03:24:22,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 03:24:22,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 03:24:22,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 03:24:22,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 03:24:22,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 03:24:22,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 03:24:22,916 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 03:24:22,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 03:24:22,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 03:24:22,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 03:24:22,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 03:24:22,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 03:24:22,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 03:24:22,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 03:24:22,920 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 03:24:22,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 03:24:22,921 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 03:24:22,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 03:24:22,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 03:24:22,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 03:24:22,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 03:24:22,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 03:24:22,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 03:24:22,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 03:24:22,923 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 03:24:22,923 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 03:24:22,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 03:24:22,923 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 03:24:22,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 03:24:22,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 03:24:22,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 03:24:22,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 03:24:22,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:24:22,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 03:24:22,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 03:24:22,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 03:24:22,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 03:24:22,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 03:24:22,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 03:24:22,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 03:24:22,926 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 03:24:22,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 03:24:22,926 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 03:24:22,927 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 -> 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b 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 03:24:23,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 03:24:23,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 03:24:23,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 03:24:23,265 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 03:24:23,265 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 03:24:23,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2023-08-29 03:24:24,440 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 03:24:24,676 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 03:24:24,676 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2023-08-29 03:24:24,682 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f818ab8/7ec6d2a0b4564b5182779ff3753e2dfb/FLAGf7d6d1f46 [2023-08-29 03:24:25,030 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f818ab8/7ec6d2a0b4564b5182779ff3753e2dfb [2023-08-29 03:24:25,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 03:24:25,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 03:24:25,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 03:24:25,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 03:24:25,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 03:24:25,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c53a366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25, skipping insertion in model container [2023-08-29 03:24:25,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 03:24:25,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 03:24:25,268 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c[2817,2830] [2023-08-29 03:24:25,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:24:25,289 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 03:24:25,336 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c[2817,2830] [2023-08-29 03:24:25,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:24:25,362 INFO L208 MainTranslator]: Completed translation [2023-08-29 03:24:25,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25 WrapperNode [2023-08-29 03:24:25,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 03:24:25,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 03:24:25,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 03:24:25,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 03:24:25,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,433 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 327 [2023-08-29 03:24:25,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 03:24:25,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 03:24:25,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 03:24:25,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 03:24:25,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,517 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 03:24:25,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 03:24:25,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 03:24:25,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 03:24:25,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (1/1) ... [2023-08-29 03:24:25,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:24:25,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:24:25,570 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 03:24:25,601 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 03:24:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 03:24:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 03:24:25,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 03:24:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 03:24:25,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 03:24:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 03:24:25,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 03:24:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 03:24:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 03:24:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 03:24:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 03:24:25,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 03:24:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 03:24:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 03:24:25,622 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 03:24:25,788 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 03:24:25,793 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 03:24:26,242 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 03:24:26,254 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 03:24:26,254 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 03:24:26,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:24:26 BoogieIcfgContainer [2023-08-29 03:24:26,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 03:24:26,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 03:24:26,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 03:24:26,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 03:24:26,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 03:24:25" (1/3) ... [2023-08-29 03:24:26,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436d955b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:24:26, skipping insertion in model container [2023-08-29 03:24:26,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:24:25" (2/3) ... [2023-08-29 03:24:26,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436d955b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:24:26, skipping insertion in model container [2023-08-29 03:24:26,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:24:26" (3/3) ... [2023-08-29 03:24:26,264 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2023-08-29 03:24:26,272 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 03:24:26,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 03:24:26,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-08-29 03:24:26,289 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 03:24:26,440 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 03:24:26,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 390 places, 401 transitions, 826 flow [2023-08-29 03:24:26,657 INFO L130 PetriNetUnfolder]: 21/398 cut-off events. [2023-08-29 03:24:26,657 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:24:26,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 398 events. 21/398 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1041 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 264. Up to 2 conditions per place. [2023-08-29 03:24:26,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 390 places, 401 transitions, 826 flow [2023-08-29 03:24:26,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 368 places, 377 transitions, 772 flow [2023-08-29 03:24:26,679 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:24:26,692 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 368 places, 377 transitions, 772 flow [2023-08-29 03:24:26,697 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 377 transitions, 772 flow [2023-08-29 03:24:26,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 377 transitions, 772 flow [2023-08-29 03:24:26,779 INFO L130 PetriNetUnfolder]: 19/377 cut-off events. [2023-08-29 03:24:26,779 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 03:24:26,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 377 events. 19/377 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1027 event pairs, 0 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 264. Up to 2 conditions per place. [2023-08-29 03:24:26,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 42486 [2023-08-29 03:24:34,389 INFO L134 LiptonReduction]: Checked pairs total: 172014 [2023-08-29 03:24:34,389 INFO L136 LiptonReduction]: Total number of compositions: 369 [2023-08-29 03:24:34,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:24:34,413 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;@532a5132, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:24:34,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-08-29 03:24:34,415 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 03:24:34,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:24:34,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:34,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 03:24:34,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:34,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1491, now seen corresponding path program 1 times [2023-08-29 03:24:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:34,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564846833] [2023-08-29 03:24:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:34,528 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 03:24:34,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564846833] [2023-08-29 03:24:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564846833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 03:24:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269365980] [2023-08-29 03:24:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:34,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 03:24:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 03:24:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 03:24:34,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 770 [2023-08-29 03:24:34,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 387.5) internal successors, (775), 2 states have internal predecessors, (775), 0 states have call successors, (0), 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 03:24:34,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:34,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 770 [2023-08-29 03:24:34,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:35,714 INFO L130 PetriNetUnfolder]: 6016/10505 cut-off events. [2023-08-29 03:24:35,714 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2023-08-29 03:24:35,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18619 conditions, 10505 events. 6016/10505 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 80752 event pairs, 3768 based on Foata normal form. 486/8566 useless extension candidates. Maximal degree in co-relation 17243. Up to 7837 conditions per place. [2023-08-29 03:24:35,796 INFO L137 encePairwiseOnDemand]: 749/770 looper letters, 47 selfloop transitions, 0 changer transitions 1/98 dead transitions. [2023-08-29 03:24:35,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 310 flow [2023-08-29 03:24:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 03:24:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 03:24:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 843 transitions. [2023-08-29 03:24:35,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5474025974025974 [2023-08-29 03:24:35,818 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 843 transitions. [2023-08-29 03:24:35,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 843 transitions. [2023-08-29 03:24:35,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:35,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 843 transitions. [2023-08-29 03:24:35,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 421.5) internal successors, (843), 2 states have internal predecessors, (843), 0 states have call successors, (0), 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 03:24:35,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 770.0) internal successors, (2310), 3 states have internal predecessors, (2310), 0 states have call successors, (0), 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 03:24:35,839 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 770.0) internal successors, (2310), 3 states have internal predecessors, (2310), 0 states have call successors, (0), 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 03:24:35,841 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 256 flow. Second operand 2 states and 843 transitions. [2023-08-29 03:24:35,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 310 flow [2023-08-29 03:24:35,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 03:24:35,860 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 199 flow [2023-08-29 03:24:35,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=199, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-29 03:24:35,868 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-29 03:24:35,869 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 199 flow [2023-08-29 03:24:35,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 387.5) internal successors, (775), 2 states have internal predecessors, (775), 0 states have call successors, (0), 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 03:24:35,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:35,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 03:24:35,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 03:24:35,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:35,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 46108271, now seen corresponding path program 1 times [2023-08-29 03:24:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745493271] [2023-08-29 03:24:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:35,994 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 03:24:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745493271] [2023-08-29 03:24:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745493271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126791123] [2023-08-29 03:24:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:36,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 770 [2023-08-29 03:24:36,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:24:36,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:36,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 770 [2023-08-29 03:24:36,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:37,098 INFO L130 PetriNetUnfolder]: 7789/13279 cut-off events. [2023-08-29 03:24:37,099 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-08-29 03:24:37,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23573 conditions, 13279 events. 7789/13279 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 102422 event pairs, 1664 based on Foata normal form. 0/10570 useless extension candidates. Maximal degree in co-relation 23570. Up to 10111 conditions per place. [2023-08-29 03:24:37,185 INFO L137 encePairwiseOnDemand]: 766/770 looper letters, 67 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-08-29 03:24:37,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 373 flow [2023-08-29 03:24:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1211 transitions. [2023-08-29 03:24:37,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242424242424243 [2023-08-29 03:24:37,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1211 transitions. [2023-08-29 03:24:37,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1211 transitions. [2023-08-29 03:24:37,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:37,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1211 transitions. [2023-08-29 03:24:37,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 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 03:24:37,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:37,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:37,201 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 199 flow. Second operand 3 states and 1211 transitions. [2023-08-29 03:24:37,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 373 flow [2023-08-29 03:24:37,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 114 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:37,205 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 209 flow [2023-08-29 03:24:37,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-29 03:24:37,206 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-29 03:24:37,206 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 209 flow [2023-08-29 03:24:37,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:24:37,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:37,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 03:24:37,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 03:24:37,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:37,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1360651891, now seen corresponding path program 1 times [2023-08-29 03:24:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:37,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116504001] [2023-08-29 03:24:37,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:37,273 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 03:24:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116504001] [2023-08-29 03:24:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116504001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:37,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670052595] [2023-08-29 03:24:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:37,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:37,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 770 [2023-08-29 03:24:37,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 378.6666666666667) internal successors, (1136), 3 states have internal predecessors, (1136), 0 states have call successors, (0), 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 03:24:37,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:37,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 770 [2023-08-29 03:24:37,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:38,396 INFO L130 PetriNetUnfolder]: 8818/15602 cut-off events. [2023-08-29 03:24:38,396 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2023-08-29 03:24:38,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27347 conditions, 15602 events. 8818/15602 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 126774 event pairs, 3754 based on Foata normal form. 0/12195 useless extension candidates. Maximal degree in co-relation 27343. Up to 11411 conditions per place. [2023-08-29 03:24:38,501 INFO L137 encePairwiseOnDemand]: 764/770 looper letters, 70 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2023-08-29 03:24:38,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 395 flow [2023-08-29 03:24:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2023-08-29 03:24:38,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225108225108225 [2023-08-29 03:24:38,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2023-08-29 03:24:38,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2023-08-29 03:24:38,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:38,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2023-08-29 03:24:38,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 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 03:24:38,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:38,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:38,516 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 209 flow. Second operand 3 states and 1207 transitions. [2023-08-29 03:24:38,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 395 flow [2023-08-29 03:24:38,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:38,521 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 224 flow [2023-08-29 03:24:38,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-29 03:24:38,523 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-29 03:24:38,526 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 224 flow [2023-08-29 03:24:38,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.6666666666667) internal successors, (1136), 3 states have internal predecessors, (1136), 0 states have call successors, (0), 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 03:24:38,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:38,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:38,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 03:24:38,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:38,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1898758854, now seen corresponding path program 1 times [2023-08-29 03:24:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:38,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370680726] [2023-08-29 03:24:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:38,588 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 03:24:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:38,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370680726] [2023-08-29 03:24:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370680726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722195547] [2023-08-29 03:24:38,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:38,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 770 [2023-08-29 03:24:38,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:24:38,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:38,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 770 [2023-08-29 03:24:38,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:39,615 INFO L130 PetriNetUnfolder]: 7931/14040 cut-off events. [2023-08-29 03:24:39,615 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-29 03:24:39,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24657 conditions, 14040 events. 7931/14040 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 112051 event pairs, 1252 based on Foata normal form. 0/11059 useless extension candidates. Maximal degree in co-relation 24652. Up to 10042 conditions per place. [2023-08-29 03:24:39,706 INFO L137 encePairwiseOnDemand]: 762/770 looper letters, 68 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2023-08-29 03:24:39,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 116 transitions, 408 flow [2023-08-29 03:24:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2023-08-29 03:24:39,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186147186147186 [2023-08-29 03:24:39,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1198 transitions. [2023-08-29 03:24:39,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1198 transitions. [2023-08-29 03:24:39,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:39,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1198 transitions. [2023-08-29 03:24:39,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 0 states have call successors, (0), 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 03:24:39,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:39,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:39,720 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 224 flow. Second operand 3 states and 1198 transitions. [2023-08-29 03:24:39,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 116 transitions, 408 flow [2023-08-29 03:24:39,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 116 transitions, 408 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:39,723 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 244 flow [2023-08-29 03:24:39,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2023-08-29 03:24:39,724 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -24 predicate places. [2023-08-29 03:24:39,724 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 244 flow [2023-08-29 03:24:39,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:24:39,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:39,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:39,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 03:24:39,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:39,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1917402202, now seen corresponding path program 1 times [2023-08-29 03:24:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099067303] [2023-08-29 03:24:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:39,755 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 03:24:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099067303] [2023-08-29 03:24:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099067303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:39,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395892497] [2023-08-29 03:24:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:39,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:39,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:39,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 770 [2023-08-29 03:24:39,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 381.6666666666667) internal successors, (1145), 3 states have internal predecessors, (1145), 0 states have call successors, (0), 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 03:24:39,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:39,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 770 [2023-08-29 03:24:39,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:40,899 INFO L130 PetriNetUnfolder]: 9583/16883 cut-off events. [2023-08-29 03:24:40,899 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2023-08-29 03:24:40,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30909 conditions, 16883 events. 9583/16883 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 140563 event pairs, 2068 based on Foata normal form. 0/13325 useless extension candidates. Maximal degree in co-relation 30903. Up to 9412 conditions per place. [2023-08-29 03:24:41,038 INFO L137 encePairwiseOnDemand]: 766/770 looper letters, 84 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-08-29 03:24:41,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 498 flow [2023-08-29 03:24:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2023-08-29 03:24:41,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5298701298701298 [2023-08-29 03:24:41,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1224 transitions. [2023-08-29 03:24:41,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1224 transitions. [2023-08-29 03:24:41,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:41,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1224 transitions. [2023-08-29 03:24:41,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 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 03:24:41,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:41,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:41,052 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 244 flow. Second operand 3 states and 1224 transitions. [2023-08-29 03:24:41,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 498 flow [2023-08-29 03:24:41,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 131 transitions, 498 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:41,056 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 254 flow [2023-08-29 03:24:41,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-29 03:24:41,057 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-29 03:24:41,057 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 254 flow [2023-08-29 03:24:41,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.6666666666667) internal successors, (1145), 3 states have internal predecessors, (1145), 0 states have call successors, (0), 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 03:24:41,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:41,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:41,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 03:24:41,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:41,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 654972661, now seen corresponding path program 1 times [2023-08-29 03:24:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257604607] [2023-08-29 03:24:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:41,117 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 03:24:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257604607] [2023-08-29 03:24:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257604607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:41,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:41,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858485091] [2023-08-29 03:24:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:41,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:41,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 770 [2023-08-29 03:24:41,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 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 03:24:41,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:41,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 770 [2023-08-29 03:24:41,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:42,572 INFO L130 PetriNetUnfolder]: 12992/22617 cut-off events. [2023-08-29 03:24:42,572 INFO L131 PetriNetUnfolder]: For 975/975 co-relation queries the response was YES. [2023-08-29 03:24:42,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42524 conditions, 22617 events. 12992/22617 cut-off events. For 975/975 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 193380 event pairs, 3588 based on Foata normal form. 0/17677 useless extension candidates. Maximal degree in co-relation 42517. Up to 11401 conditions per place. [2023-08-29 03:24:42,704 INFO L137 encePairwiseOnDemand]: 764/770 looper letters, 91 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2023-08-29 03:24:42,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 135 transitions, 537 flow [2023-08-29 03:24:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2023-08-29 03:24:42,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.529004329004329 [2023-08-29 03:24:42,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1222 transitions. [2023-08-29 03:24:42,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1222 transitions. [2023-08-29 03:24:42,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:42,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1222 transitions. [2023-08-29 03:24:42,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 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 03:24:42,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:42,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:42,723 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 254 flow. Second operand 3 states and 1222 transitions. [2023-08-29 03:24:42,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 135 transitions, 537 flow [2023-08-29 03:24:42,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:42,727 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 269 flow [2023-08-29 03:24:42,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-29 03:24:42,728 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-29 03:24:42,728 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 269 flow [2023-08-29 03:24:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 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 03:24:42,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:42,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 03:24:42,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:42,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1931182979, now seen corresponding path program 1 times [2023-08-29 03:24:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829034089] [2023-08-29 03:24:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:42,895 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 03:24:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829034089] [2023-08-29 03:24:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829034089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:42,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491488787] [2023-08-29 03:24:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:42,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:42,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 770 [2023-08-29 03:24:42,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 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 03:24:42,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:42,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 770 [2023-08-29 03:24:42,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:44,658 INFO L130 PetriNetUnfolder]: 17170/27188 cut-off events. [2023-08-29 03:24:44,659 INFO L131 PetriNetUnfolder]: For 1373/1373 co-relation queries the response was YES. [2023-08-29 03:24:44,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53729 conditions, 27188 events. 17170/27188 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 207070 event pairs, 5231 based on Foata normal form. 0/20951 useless extension candidates. Maximal degree in co-relation 53721. Up to 14960 conditions per place. [2023-08-29 03:24:44,775 INFO L137 encePairwiseOnDemand]: 762/770 looper letters, 92 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2023-08-29 03:24:44,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 133 transitions, 545 flow [2023-08-29 03:24:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1218 transitions. [2023-08-29 03:24:44,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2023-08-29 03:24:44,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1218 transitions. [2023-08-29 03:24:44,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1218 transitions. [2023-08-29 03:24:44,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:44,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1218 transitions. [2023-08-29 03:24:44,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 0 states have call successors, (0), 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 03:24:44,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:44,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:44,784 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 269 flow. Second operand 3 states and 1218 transitions. [2023-08-29 03:24:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 133 transitions, 545 flow [2023-08-29 03:24:44,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 133 transitions, 545 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:44,788 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 289 flow [2023-08-29 03:24:44,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2023-08-29 03:24:44,789 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -24 predicate places. [2023-08-29 03:24:44,789 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 289 flow [2023-08-29 03:24:44,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 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 03:24:44,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:44,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:44,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 03:24:44,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:44,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1922239274, now seen corresponding path program 1 times [2023-08-29 03:24:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397387964] [2023-08-29 03:24:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:44,815 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 03:24:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397387964] [2023-08-29 03:24:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397387964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:44,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:44,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:44,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581922308] [2023-08-29 03:24:44,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:44,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:44,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 770 [2023-08-29 03:24:44,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 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 03:24:44,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:44,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 770 [2023-08-29 03:24:44,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:46,611 INFO L130 PetriNetUnfolder]: 17905/28346 cut-off events. [2023-08-29 03:24:46,611 INFO L131 PetriNetUnfolder]: For 1313/1313 co-relation queries the response was YES. [2023-08-29 03:24:46,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57760 conditions, 28346 events. 17905/28346 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 217838 event pairs, 7496 based on Foata normal form. 0/23278 useless extension candidates. Maximal degree in co-relation 57751. Up to 14106 conditions per place. [2023-08-29 03:24:46,757 INFO L137 encePairwiseOnDemand]: 766/770 looper letters, 97 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-08-29 03:24:46,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 141 transitions, 591 flow [2023-08-29 03:24:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2023-08-29 03:24:46,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535064935064935 [2023-08-29 03:24:46,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1236 transitions. [2023-08-29 03:24:46,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1236 transitions. [2023-08-29 03:24:46,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:46,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1236 transitions. [2023-08-29 03:24:46,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 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 03:24:46,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:46,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:46,769 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 289 flow. Second operand 3 states and 1236 transitions. [2023-08-29 03:24:46,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 141 transitions, 591 flow [2023-08-29 03:24:46,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 141 transitions, 591 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:46,776 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 299 flow [2023-08-29 03:24:46,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-29 03:24:46,779 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-29 03:24:46,779 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 299 flow [2023-08-29 03:24:46,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 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 03:24:46,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:46,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:46,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 03:24:46,781 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:46,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash -439975094, now seen corresponding path program 1 times [2023-08-29 03:24:46,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:46,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766703498] [2023-08-29 03:24:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:46,821 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 03:24:46,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766703498] [2023-08-29 03:24:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766703498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:46,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522902013] [2023-08-29 03:24:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:46,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:46,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:46,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 770 [2023-08-29 03:24:46,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 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 03:24:46,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:46,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 770 [2023-08-29 03:24:46,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:48,744 INFO L130 PetriNetUnfolder]: 19120/30407 cut-off events. [2023-08-29 03:24:48,744 INFO L131 PetriNetUnfolder]: For 2086/2086 co-relation queries the response was YES. [2023-08-29 03:24:48,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63138 conditions, 30407 events. 19120/30407 cut-off events. For 2086/2086 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 237003 event pairs, 9098 based on Foata normal form. 0/24946 useless extension candidates. Maximal degree in co-relation 63128. Up to 16760 conditions per place. [2023-08-29 03:24:49,053 INFO L137 encePairwiseOnDemand]: 766/770 looper letters, 99 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2023-08-29 03:24:49,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 143 transitions, 617 flow [2023-08-29 03:24:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-08-29 03:24:49,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346320346320347 [2023-08-29 03:24:49,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-08-29 03:24:49,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-08-29 03:24:49,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:49,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-08-29 03:24:49,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 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 03:24:49,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:49,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:49,071 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 299 flow. Second operand 3 states and 1235 transitions. [2023-08-29 03:24:49,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 143 transitions, 617 flow [2023-08-29 03:24:49,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 143 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:49,081 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 309 flow [2023-08-29 03:24:49,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2023-08-29 03:24:49,082 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -22 predicate places. [2023-08-29 03:24:49,082 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 97 transitions, 309 flow [2023-08-29 03:24:49,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 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 03:24:49,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:24:49,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:49,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 03:24:49,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-08-29 03:24:49,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:24:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1909237235, now seen corresponding path program 1 times [2023-08-29 03:24:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:24:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340775831] [2023-08-29 03:24:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:24:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:24:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:24:49,113 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 03:24:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:24:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340775831] [2023-08-29 03:24:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340775831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:24:49,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:24:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:24:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8040053] [2023-08-29 03:24:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:24:49,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:24:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:24:49,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:24:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:24:49,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 770 [2023-08-29 03:24:49,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 97 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 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 03:24:49,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:24:49,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 770 [2023-08-29 03:24:49,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:24:51,155 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), Black: 416#true, 428#(= |#race~filename_1~0| 0), 59#L50-36true, 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, 150#L77-4true, Black: 396#true, Black: 431#true, Black: 401#true, 141#L56-36true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,155 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 03:24:51,155 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 03:24:51,156 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 03:24:51,156 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 03:24:51,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), 428#(= |#race~filename_1~0| 0), 172#L78-6true, Black: 416#true, 59#L50-36true, 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, Black: 396#true, Black: 431#true, Black: 401#true, 141#L56-36true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,160 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:24:51,160 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,160 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,160 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,162 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), Black: 416#true, 428#(= |#race~filename_1~0| 0), 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, 150#L77-4true, Black: 396#true, 69#thread2EXITtrue, Black: 431#true, Black: 401#true, 141#L56-36true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,162 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:24:51,162 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,162 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,162 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), Black: 416#true, 428#(= |#race~filename_1~0| 0), 59#L50-36true, 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, 150#L77-4true, Black: 396#true, Black: 431#true, Black: 401#true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, 128#thread3EXITtrue, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,163 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 03:24:51,163 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,163 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,163 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 03:24:51,167 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), 428#(= |#race~filename_1~0| 0), 172#L78-6true, Black: 416#true, 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, 69#thread2EXITtrue, Black: 396#true, Black: 431#true, Black: 401#true, 141#L56-36true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,167 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:24:51,167 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,167 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,167 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), 428#(= |#race~filename_1~0| 0), 172#L78-6true, Black: 416#true, 59#L50-36true, 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, Black: 396#true, Black: 431#true, Black: 401#true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, 128#thread3EXITtrue, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,168 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:24:51,168 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,168 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,168 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), Black: 416#true, 428#(= |#race~filename_1~0| 0), 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, 150#L77-4true, Black: 396#true, 69#thread2EXITtrue, Black: 431#true, Black: 401#true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, 128#thread3EXITtrue, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,169 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 03:24:51,170 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,170 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,170 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 03:24:51,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1464] L44-26-->L44-37: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_45|) (= |v_thread1Thread1of1ForFork2_minus_~a#1_55| |v_thread1Thread1of1ForFork2_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_45| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#in~b#1_23|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_23| v_~filename_1~0_57) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_37| 2147483647) (= v_~result_9~0_56 |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| |v_thread1Thread1of1ForFork2_minus_#res#1_41|) |v_thread1Thread1of1ForFork2_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_23| v_~filename_4~0_55) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_43|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_55|) (<= |v_thread1Thread1of1ForFork2_minus_~a#1_55| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_55| 2147483647))) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_41| |v_thread1Thread1of1ForFork2_#t~ret1#1_37|) (= |v_#race~filename_4~0_44| 0)) InVars {~filename_1~0=v_~filename_1~0_57, ~filename_4~0=v_~filename_4~0_55, #race~filename_4~0=|v_#race~filename_4~0_44|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_23|, ~filename_1~0=v_~filename_1~0_57, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_43|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_41|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_45|, ~result_9~0=v_~result_9~0_56, ~filename_4~0=v_~filename_4~0_55, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_23|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_55|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_55|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_63|, #race~filename_4~0=|v_#race~filename_4~0_44|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][131], [408#(= |#race~isNull_6~0| 0), 433#(= |#race~filename_4~0| 0), 418#(= |#race~filename_5~0| 0), 428#(= |#race~filename_1~0| 0), 172#L78-6true, Black: 416#true, 403#(= |#race~isNull_3~0| 0), Black: 421#true, 438#(= |#race~filename_7~0| 0), Black: 426#true, 69#thread2EXITtrue, Black: 396#true, Black: 431#true, Black: 401#true, 398#(= |#race~isNull_0~0| 0), 221#L44-37true, 128#thread3EXITtrue, Black: 406#true, 423#(= |#race~filename_8~0| 0), 413#(= |#race~filename_2~0| 0), 393#true, Black: 411#true]) [2023-08-29 03:24:51,172 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 03:24:51,172 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 03:24:51,172 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 03:24:51,172 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 03:24:51,173 INFO L130 PetriNetUnfolder]: 20036/31054 cut-off events. [2023-08-29 03:24:51,173 INFO L131 PetriNetUnfolder]: For 2793/2793 co-relation queries the response was YES. [2023-08-29 03:24:51,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66636 conditions, 31054 events. 20036/31054 cut-off events. For 2793/2793 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 232137 event pairs, 10208 based on Foata normal form. 0/25357 useless extension candidates. Maximal degree in co-relation 66625. Up to 18576 conditions per place. [2023-08-29 03:24:51,289 INFO L137 encePairwiseOnDemand]: 766/770 looper letters, 0 selfloop transitions, 0 changer transitions 141/141 dead transitions. [2023-08-29 03:24:51,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 141 transitions, 619 flow [2023-08-29 03:24:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:24:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:24:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2023-08-29 03:24:51,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5341991341991342 [2023-08-29 03:24:51,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1234 transitions. [2023-08-29 03:24:51,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1234 transitions. [2023-08-29 03:24:51,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:24:51,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1234 transitions. [2023-08-29 03:24:51,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 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 03:24:51,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:51,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 770.0) internal successors, (3080), 4 states have internal predecessors, (3080), 0 states have call successors, (0), 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 03:24:51,300 INFO L175 Difference]: Start difference. First operand has 92 places, 97 transitions, 309 flow. Second operand 3 states and 1234 transitions. [2023-08-29 03:24:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 141 transitions, 619 flow [2023-08-29 03:24:51,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 619 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:24:51,308 INFO L231 Difference]: Finished difference. Result has 92 places, 0 transitions, 0 flow [2023-08-29 03:24:51,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=770, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=92, PETRI_TRANSITIONS=0} [2023-08-29 03:24:51,309 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -22 predicate places. [2023-08-29 03:24:51,309 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 0 transitions, 0 flow [2023-08-29 03:24:51,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 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 03:24:51,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2023-08-29 03:24:51,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2023-08-29 03:24:51,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2023-08-29 03:24:51,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2023-08-29 03:24:51,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2023-08-29 03:24:51,313 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2023-08-29 03:24:51,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2023-08-29 03:24:51,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2023-08-29 03:24:51,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2023-08-29 03:24:51,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2023-08-29 03:24:51,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2023-08-29 03:24:51,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2023-08-29 03:24:51,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2023-08-29 03:24:51,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2023-08-29 03:24:51,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2023-08-29 03:24:51,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2023-08-29 03:24:51,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2023-08-29 03:24:51,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2023-08-29 03:24:51,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2023-08-29 03:24:51,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2023-08-29 03:24:51,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2023-08-29 03:24:51,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2023-08-29 03:24:51,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2023-08-29 03:24:51,316 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2023-08-29 03:24:51,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2023-08-29 03:24:51,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2023-08-29 03:24:51,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2023-08-29 03:24:51,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2023-08-29 03:24:51,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2023-08-29 03:24:51,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2023-08-29 03:24:51,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2023-08-29 03:24:51,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2023-08-29 03:24:51,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2023-08-29 03:24:51,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2023-08-29 03:24:51,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2023-08-29 03:24:51,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2023-08-29 03:24:51,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2023-08-29 03:24:51,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2023-08-29 03:24:51,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2023-08-29 03:24:51,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2023-08-29 03:24:51,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2023-08-29 03:24:51,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2023-08-29 03:24:51,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2023-08-29 03:24:51,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2023-08-29 03:24:51,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining) [2023-08-29 03:24:51,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2023-08-29 03:24:51,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2023-08-29 03:24:51,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2023-08-29 03:24:51,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2023-08-29 03:24:51,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2023-08-29 03:24:51,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2023-08-29 03:24:51,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2023-08-29 03:24:51,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2023-08-29 03:24:51,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2023-08-29 03:24:51,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2023-08-29 03:24:51,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2023-08-29 03:24:51,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2023-08-29 03:24:51,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2023-08-29 03:24:51,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2023-08-29 03:24:51,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2023-08-29 03:24:51,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2023-08-29 03:24:51,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2023-08-29 03:24:51,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2023-08-29 03:24:51,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2023-08-29 03:24:51,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2023-08-29 03:24:51,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2023-08-29 03:24:51,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2023-08-29 03:24:51,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2023-08-29 03:24:51,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2023-08-29 03:24:51,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2023-08-29 03:24:51,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2023-08-29 03:24:51,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2023-08-29 03:24:51,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 03:24:51,325 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:24:51,330 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 03:24:51,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 03:24:51,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 03:24:51 BasicIcfg [2023-08-29 03:24:51,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 03:24:51,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 03:24:51,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 03:24:51,334 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 03:24:51,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:24:26" (3/4) ... [2023-08-29 03:24:51,337 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-08-29 03:24:51,342 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-08-29 03:24:51,342 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-08-29 03:24:51,342 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-08-29 03:24:51,347 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-08-29 03:24:51,347 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-08-29 03:24:51,347 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-08-29 03:24:51,348 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-08-29 03:24:51,382 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-29 03:24:51,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 03:24:51,383 INFO L158 Benchmark]: Toolchain (without parser) took 26349.97ms. Allocated memory was 73.4MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 51.5MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 03:24:51,383 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 03:24:51,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.30ms. Allocated memory is still 73.4MB. Free memory was 51.3MB in the beginning and 38.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-29 03:24:51,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.31ms. Allocated memory is still 73.4MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:24:51,384 INFO L158 Benchmark]: Boogie Preprocessor took 100.79ms. Allocated memory is still 73.4MB. Free memory was 36.0MB in the beginning and 53.0MB in the end (delta: -17.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 03:24:51,384 INFO L158 Benchmark]: RCFGBuilder took 718.99ms. Allocated memory is still 73.4MB. Free memory was 52.7MB in the beginning and 48.2MB in the end (delta: 4.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-08-29 03:24:51,385 INFO L158 Benchmark]: TraceAbstraction took 25075.17ms. Allocated memory was 73.4MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 47.7MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-08-29 03:24:51,385 INFO L158 Benchmark]: Witness Printer took 48.32ms. Allocated memory is still 8.8GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:24:51,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.30ms. Allocated memory is still 73.4MB. Free memory was 51.3MB in the beginning and 38.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.31ms. Allocated memory is still 73.4MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.79ms. Allocated memory is still 73.4MB. Free memory was 36.0MB in the beginning and 53.0MB in the end (delta: -17.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 718.99ms. Allocated memory is still 73.4MB. Free memory was 52.7MB in the beginning and 48.2MB in the end (delta: 4.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25075.17ms. Allocated memory was 73.4MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 47.7MB in the beginning and 7.5GB in the end (delta: -7.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 48.32ms. Allocated memory is still 8.8GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 368 PlacesBefore, 114 PlacesAfterwards, 377 TransitionsBefore, 119 TransitionsAfterwards, 42486 CoEnabledTransitionPairs, 9 FixpointIterations, 136 TrivialSequentialCompositions, 166 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 57 ConcurrentYvCompositions, 4 ChoiceCompositions, 369 TotalNumberOfCompositions, 172014 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92619, independent: 91027, independent conditional: 0, independent unconditional: 91027, dependent: 1592, dependent conditional: 0, dependent unconditional: 1592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 25431, independent: 25288, independent conditional: 0, independent unconditional: 25288, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92619, independent: 65739, independent conditional: 0, independent unconditional: 65739, dependent: 1449, dependent conditional: 0, dependent unconditional: 1449, unknown: 25431, unknown conditional: 0, unknown unconditional: 25431] , Statistics on independence cache: Total cache size (in pairs): 2780, Positive cache size: 2701, Positive conditional cache size: 0, Positive unconditional cache size: 2701, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 588 locations, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 54 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=9, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-29 03:24:51,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE