./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version b8dbc81d
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c0827ac193c1e2b03d5ccf1e60b62c7d6ff1b4feade2c409a6c7ca2cebf9412 --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-28 17:59:59,880 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2023-08-28 17:59:59,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-28 17:59:59,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-28 17:59:59,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-28 17:59:59,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-28 17:59:59,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-28 17:59:59,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-28 17:59:59,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-28 17:59:59,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-28 17:59:59,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2023-08-28 17:59:59,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-28 17:59:59,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-28 17:59:59,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-28 17:59:59,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-28 17:59:59,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-28 17:59:59,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-28 17:59:59,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-28 17:59:59,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-28 17:59:59,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-28 17:59:59,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-28 17:59:59,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-28 17:59:59,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2023-08-28 17:59:59,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-28 17:59:59,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-28 17:59:59,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-28 17:59:59,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-28 17:59:59,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-28 17:59:59,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-28 17:59:59,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-28 17:59:59,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-28 17:59:59,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-28 17:59:59,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-28 17:59:59,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-28 17:59:59,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-28 17:59:59,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-28 17:59:59,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-28 18:00:00,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-28 18:00:00,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-28 18:00:00,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-28 18:00:00,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2023-08-28 18:00:00,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-08-28 18:00:00,039 INFO L113 SettingsManager]: Loading preferences was successful
[2023-08-28 18:00:00,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-28 18:00:00,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-28 18:00:00,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-28 18:00:00,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-28 18:00:00,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-28 18:00:00,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-28 18:00:00,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-28 18:00:00,043 INFO L138 SettingsManager]: * Use SBE=true
[2023-08-28 18:00:00,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-28 18:00:00,043 INFO L138 SettingsManager]: * sizeof long=4
[2023-08-28 18:00:00,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2023-08-28 18:00:00,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-28 18:00:00,044 INFO L138 SettingsManager]: * sizeof POINTER=4
[2023-08-28 18:00:00,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2023-08-28 18:00:00,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-08-28 18:00:00,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-28 18:00:00,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-08-28 18:00:00,045 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true
[2023-08-28 18:00:00,045 INFO L138 SettingsManager]: * sizeof long double=12
[2023-08-28 18:00:00,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2023-08-28 18:00:00,046 INFO L138 SettingsManager]: * Use constant arrays=true
[2023-08-28 18:00:00,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-08-28 18:00:00,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-28 18:00:00,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-28 18:00:00,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-28 18:00:00,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-28 18:00:00,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-28 18:00:00,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-28 18:00:00,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-08-28 18:00:00,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-08-28 18:00:00,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-28 18:00:00,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-28 18:00:00,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-08-28 18:00:00,048 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-08-28 18:00:00,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-28 18:00:00,049 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-28 18:00:00,049 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 -> 8c0827ac193c1e2b03d5ccf1e60b62c7d6ff1b4feade2c409a6c7ca2cebf9412
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-28 18:00:00,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-28 18:00:00,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-28 18:00:00,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-28 18:00:00,368 INFO L271 PluginConnector]: Initializing CDTParser...
[2023-08-28 18:00:00,368 INFO L275 PluginConnector]: CDTParser initialized
[2023-08-28 18:00:00,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i
[2023-08-28 18:00:01,505 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2023-08-28 18:00:01,751 INFO L351 CDTParser]: Found 1 translation units.
[2023-08-28 18:00:01,752 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i
[2023-08-28 18:00:01,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcaec438a/4d2a9d4bdbe34050a62bd2eff915847d/FLAGbf763e8ae
[2023-08-28 18:00:01,791 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcaec438a/4d2a9d4bdbe34050a62bd2eff915847d
[2023-08-28 18:00:01,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-28 18:00:01,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-28 18:00:01,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-28 18:00:01,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-28 18:00:01,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-28 18:00:01,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.08 06:00:01" (1/1) ...
[2023-08-28 18:00:01,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252e75e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:01, skipping insertion in model container
[2023-08-28 18:00:01,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.08 06:00:01" (1/1) ...
[2023-08-28 18:00:01,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-08-28 18:00:01,854 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-08-28 18:00:02,166 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i[31167,31180]
[2023-08-28 18:00:02,171 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-28 18:00:02,183 INFO L203 MainTranslator]: Completed pre-run
[2023-08-28 18:00:02,250 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i[31167,31180]
[2023-08-28 18:00:02,263 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-28 18:00:02,298 INFO L208 MainTranslator]: Completed translation
[2023-08-28 18:00:02,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02 WrapperNode
[2023-08-28 18:00:02,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-28 18:00:02,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-28 18:00:02,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-28 18:00:02,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-28 18:00:02,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,378 INFO L138 Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 320
[2023-08-28 18:00:02,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-28 18:00:02,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-28 18:00:02,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-28 18:00:02,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2023-08-28 18:00:02,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,436 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-28 18:00:02,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-28 18:00:02,445 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2023-08-28 18:00:02,445 INFO L275 PluginConnector]: RCFGBuilder initialized
[2023-08-28 18:00:02,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (1/1) ...
[2023-08-28 18:00:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-28 18:00:02,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-28 18:00:02,488 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-28 18:00:02,499 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-28 18:00:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2023-08-28 18:00:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure thr1
[2023-08-28 18:00:02,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1
[2023-08-28 18:00:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-08-28 18:00:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-28 18:00:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-28 18:00:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-28 18:00:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-28 18:00:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-28 18:00:02,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-28 18:00:02,527 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-28 18:00:02,644 INFO L236 CfgBuilder]: Building ICFG
[2023-08-28 18:00:02,645 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-28 18:00:03,247 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-28 18:00:03,549 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-28 18:00:03,549 INFO L302 CfgBuilder]: Removed 3 assume(true) statements.
[2023-08-28 18:00:03,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.08 06:00:03 BoogieIcfgContainer
[2023-08-28 18:00:03,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-28 18:00:03,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-28 18:00:03,553 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2023-08-28 18:00:03,556 INFO L275 PluginConnector]: TraceAbstraction initialized
[2023-08-28 18:00:03,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.08 06:00:01" (1/3) ...
[2023-08-28 18:00:03,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ddf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.08 06:00:03, skipping insertion in model container
[2023-08-28 18:00:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.08 06:00:02" (2/3) ...
[2023-08-28 18:00:03,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ddf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.08 06:00:03, skipping insertion in model container
[2023-08-28 18:00:03,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.08 06:00:03" (3/3) ...
[2023-08-28 18:00:03,559 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i
[2023-08-28 18:00:03,567 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-08-28 18:00:03,575 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-28 18:00:03,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations.
[2023-08-28 18:00:03,576 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-28 18:00:03,691 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-28 18:00:03,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:03,827 INFO L130 PetriNetUnfolder]: 11/191 cut-off events.
[2023-08-28 18:00:03,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:03,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 191 events. 11/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 157. Up to 4 conditions per place.
[2023-08-28 18:00:03,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:03,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:03,847 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-28 18:00:03,859 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:03,863 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:03,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:03,925 INFO L130 PetriNetUnfolder]: 11/191 cut-off events.
[2023-08-28 18:00:03,926 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:03,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 191 events. 11/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 157. Up to 4 conditions per place.
[2023-08-28 18:00:03,932 INFO L119 LiptonReduction]: Number of co-enabled transitions 3770
[2023-08-28 18:00:10,488 INFO L134 LiptonReduction]: Checked pairs total: 4399
[2023-08-28 18:00:10,488 INFO L136 LiptonReduction]: Total number of compositions: 195
[2023-08-28 18:00:10,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-28 18:00:10,514 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;@733ca398, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-28 18:00:10,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations.
[2023-08-28 18:00:10,521 INFO L130 PetriNetUnfolder]: 0/4 cut-off events.
[2023-08-28 18:00:10,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:10,523 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:10,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-08-28 18:00:10,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 48 more)] ===
[2023-08-28 18:00:10,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 37704300, now seen corresponding path program 1 times
[2023-08-28 18:00:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:10,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041367105]
[2023-08-28 18:00:10,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:10,731 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-28 18:00:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:10,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041367105]
[2023-08-28 18:00:10,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041367105] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:10,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:10,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-28 18:00:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453010200]
[2023-08-28 18:00:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:10,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-28 18:00:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-28 18:00:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-28 18:00:10,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 376
[2023-08-28 18:00:10,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:10,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:10,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 376
[2023-08-28 18:00:10,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:10,871 INFO L130 PetriNetUnfolder]: 43/91 cut-off events.
[2023-08-28 18:00:10,872 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:10,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 91 events. 43/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 178 event pairs, 28 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 174. Up to 91 conditions per place.
[2023-08-28 18:00:10,873 INFO L137 encePairwiseOnDemand]: 347/376 looper letters, 0 selfloop transitions, 0 changer transitions 24/24 dead transitions.
[2023-08-28 18:00:10,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 99 flow
[2023-08-28 18:00:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-28 18:00:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-28 18:00:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 356 transitions.
[2023-08-28 18:00:10,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734042553191489
[2023-08-28 18:00:10,887 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 356 transitions.
[2023-08-28 18:00:10,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 356 transitions.
[2023-08-28 18:00:10,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:10,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 356 transitions.
[2023-08-28 18:00:10,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 178.0) internal successors, (356), 2 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:10,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:10,899 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:10,901 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 111 flow. Second operand 2 states and 356 transitions.
[2023-08-28 18:00:10,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 99 flow
[2023-08-28 18:00:10,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-28 18:00:10,904 INFO L231 Difference]: Finished difference. Result has 23 places, 0 transitions, 0 flow
[2023-08-28 18:00:10,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=23, PETRI_TRANSITIONS=0}
[2023-08-28 18:00:10,909 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -26 predicate places.
[2023-08-28 18:00:10,909 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 0 transitions, 0 flow
[2023-08-28 18:00:10,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:10,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (51 of 52 remaining)
[2023-08-28 18:00:10,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining)
[2023-08-28 18:00:10,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err25ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining)
[2023-08-28 18:00:10,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining)
[2023-08-28 18:00:10,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining)
[2023-08-28 18:00:10,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err20ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining)
[2023-08-28 18:00:10,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining)
[2023-08-28 18:00:10,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining)
[2023-08-28 18:00:10,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining)
[2023-08-28 18:00:10,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining)
[2023-08-28 18:00:10,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining)
[2023-08-28 18:00:10,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining)
[2023-08-28 18:00:10,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining)
[2023-08-28 18:00:10,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining)
[2023-08-28 18:00:10,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining)
[2023-08-28 18:00:10,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining)
[2023-08-28 18:00:10,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err24ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining)
[2023-08-28 18:00:10,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining)
[2023-08-28 18:00:10,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining)
[2023-08-28 18:00:10,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining)
[2023-08-28 18:00:10,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining)
[2023-08-28 18:00:10,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining)
[2023-08-28 18:00:10,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err22ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining)
[2023-08-28 18:00:10,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err25ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining)
[2023-08-28 18:00:10,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining)
[2023-08-28 18:00:10,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err22ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining)
[2023-08-28 18:00:10,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining)
[2023-08-28 18:00:10,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining)
[2023-08-28 18:00:10,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining)
[2023-08-28 18:00:10,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining)
[2023-08-28 18:00:10,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining)
[2023-08-28 18:00:10,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining)
[2023-08-28 18:00:10,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err20ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining)
[2023-08-28 18:00:10,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err24ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining)
[2023-08-28 18:00:10,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err21ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining)
[2023-08-28 18:00:10,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining)
[2023-08-28 18:00:10,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining)
[2023-08-28 18:00:10,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining)
[2023-08-28 18:00:10,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining)
[2023-08-28 18:00:10,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining)
[2023-08-28 18:00:10,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err23ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining)
[2023-08-28 18:00:10,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining)
[2023-08-28 18:00:10,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining)
[2023-08-28 18:00:10,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err19ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining)
[2023-08-28 18:00:10,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining)
[2023-08-28 18:00:10,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining)
[2023-08-28 18:00:10,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining)
[2023-08-28 18:00:10,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining)
[2023-08-28 18:00:10,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining)
[2023-08-28 18:00:10,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining)
[2023-08-28 18:00:10,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining)
[2023-08-28 18:00:10,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining)
[2023-08-28 18:00:10,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-28 18:00:10,924 INFO L445 BasicCegarLoop]: Path program histogram: [1]
[2023-08-28 18:00:10,926 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2)
[2023-08-28 18:00:10,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:10,949 INFO L130 PetriNetUnfolder]: 11/191 cut-off events.
[2023-08-28 18:00:10,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:10,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 191 events. 11/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 157. Up to 4 conditions per place.
[2023-08-28 18:00:10,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:10,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:10,952 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-28 18:00:10,952 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:10,953 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:10,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 181 transitions, 367 flow
[2023-08-28 18:00:10,969 INFO L130 PetriNetUnfolder]: 11/191 cut-off events.
[2023-08-28 18:00:10,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:10,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 191 events. 11/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 157. Up to 4 conditions per place.
[2023-08-28 18:00:10,972 INFO L119 LiptonReduction]: Number of co-enabled transitions 3770
[2023-08-28 18:00:27,157 INFO L134 LiptonReduction]: Checked pairs total: 4748
[2023-08-28 18:00:27,158 INFO L136 LiptonReduction]: Total number of compositions: 204
[2023-08-28 18:00:27,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ========
[2023-08-28 18:00:27,160 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;@733ca398, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-28 18:00:27,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-08-28 18:00:27,164 INFO L130 PetriNetUnfolder]: 2/20 cut-off events.
[2023-08-28 18:00:27,164 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:27,164 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:27,164 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-08-28 18:00:27,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-08-28 18:00:27,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash -784694969, now seen corresponding path program 1 times
[2023-08-28 18:00:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:27,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58991487]
[2023-08-28 18:00:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-28 18:00:27,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-28 18:00:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-28 18:00:27,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-28 18:00:27,236 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-28 18:00:27,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining)
[2023-08-28 18:00:27,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-28 18:00:27,241 INFO L445 BasicCegarLoop]: Path program histogram: [1]
[2023-08-28 18:00:27,241 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2)
[2023-08-28 18:00:27,242 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-08-28 18:00:27,242 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-08-28 18:00:27,336 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-28 18:00:27,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 327 transitions, 666 flow
[2023-08-28 18:00:27,411 INFO L130 PetriNetUnfolder]: 21/349 cut-off events.
[2023-08-28 18:00:27,411 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-08-28 18:00:27,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 349 events. 21/349 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 949 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 302. Up to 6 conditions per place.
[2023-08-28 18:00:27,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 313 places, 327 transitions, 666 flow
[2023-08-28 18:00:27,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 327 transitions, 666 flow
[2023-08-28 18:00:27,424 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-28 18:00:27,424 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 327 transitions, 666 flow
[2023-08-28 18:00:27,425 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 327 transitions, 666 flow
[2023-08-28 18:00:27,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 327 transitions, 666 flow
[2023-08-28 18:00:27,492 INFO L130 PetriNetUnfolder]: 21/349 cut-off events.
[2023-08-28 18:00:27,493 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-08-28 18:00:27,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 349 events. 21/349 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 949 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 302. Up to 6 conditions per place.
[2023-08-28 18:00:27,516 INFO L119 LiptonReduction]: Number of co-enabled transitions 49880
[2023-08-28 18:00:33,216 INFO L134 LiptonReduction]: Checked pairs total: 196185
[2023-08-28 18:00:33,216 INFO L136 LiptonReduction]: Total number of compositions: 189
[2023-08-28 18:00:33,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-28 18:00:33,219 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;@733ca398, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-28 18:00:33,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations.
[2023-08-28 18:00:33,220 INFO L130 PetriNetUnfolder]: 0/5 cut-off events.
[2023-08-28 18:00:33,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-28 18:00:33,221 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:33,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-08-28 18:00:33,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:33,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 64447093, now seen corresponding path program 1 times
[2023-08-28 18:00:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570132053]
[2023-08-28 18:00:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:33,266 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-28 18:00:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570132053]
[2023-08-28 18:00:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570132053] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:33,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-28 18:00:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809554304]
[2023-08-28 18:00:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:33,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-28 18:00:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-28 18:00:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-28 18:00:33,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 516
[2023-08-28 18:00:33,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 179 transitions, 370 flow. Second operand has 2 states, 2 states have (on average 273.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:33,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:33,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 516
[2023-08-28 18:00:33,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:34,024 INFO L130 PetriNetUnfolder]: 2251/5721 cut-off events.
[2023-08-28 18:00:34,024 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES.
[2023-08-28 18:00:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9313 conditions, 5721 events. 2251/5721 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 48924 event pairs, 1751 based on Foata normal form. 0/5000 useless extension candidates. Maximal degree in co-relation 6404. Up to 3504 conditions per place.
[2023-08-28 18:00:34,062 INFO L137 encePairwiseOnDemand]: 481/516 looper letters, 61 selfloop transitions, 0 changer transitions 0/144 dead transitions.
[2023-08-28 18:00:34,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 144 transitions, 422 flow
[2023-08-28 18:00:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-28 18:00:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-28 18:00:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 638 transitions.
[2023-08-28 18:00:34,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6182170542635659
[2023-08-28 18:00:34,067 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 638 transitions.
[2023-08-28 18:00:34,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 638 transitions.
[2023-08-28 18:00:34,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:34,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 638 transitions.
[2023-08-28 18:00:34,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 319.0) internal successors, (638), 2 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:34,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 516.0) internal successors, (1548), 3 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:34,073 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 516.0) internal successors, (1548), 3 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:34,073 INFO L175 Difference]: Start difference. First operand has 170 places, 179 transitions, 370 flow. Second operand 2 states and 638 transitions.
[2023-08-28 18:00:34,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 144 transitions, 422 flow
[2023-08-28 18:00:34,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 144 transitions, 420 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-08-28 18:00:34,077 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 298 flow
[2023-08-28 18:00:34,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=298, PETRI_PLACES=140, PETRI_TRANSITIONS=144}
[2023-08-28 18:00:34,079 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -30 predicate places.
[2023-08-28 18:00:34,079 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 298 flow
[2023-08-28 18:00:34,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 273.0) internal successors, (546), 2 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:34,080 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:34,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:34,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-28 18:00:34,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:34,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1804167764, now seen corresponding path program 1 times
[2023-08-28 18:00:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840999325]
[2023-08-28 18:00:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:34,129 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-28 18:00:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:34,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840999325]
[2023-08-28 18:00:34,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840999325] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:34,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:34,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:00:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339760584]
[2023-08-28 18:00:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:34,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:00:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:00:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:00:34,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 516
[2023-08-28 18:00:34,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:34,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:34,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 516
[2023-08-28 18:00:34,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:35,840 INFO L130 PetriNetUnfolder]: 5230/12886 cut-off events.
[2023-08-28 18:00:35,840 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES.
[2023-08-28 18:00:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21208 conditions, 12886 events. 5230/12886 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 123303 event pairs, 2002 based on Foata normal form. 0/11262 useless extension candidates. Maximal degree in co-relation 21203. Up to 4188 conditions per place.
[2023-08-28 18:00:35,952 INFO L137 encePairwiseOnDemand]: 508/516 looper letters, 126 selfloop transitions, 6 changer transitions 0/208 dead transitions.
[2023-08-28 18:00:35,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 208 transitions, 695 flow
[2023-08-28 18:00:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:00:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:00:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions.
[2023-08-28 18:00:35,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5962532299741602
[2023-08-28 18:00:35,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 923 transitions.
[2023-08-28 18:00:35,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 923 transitions.
[2023-08-28 18:00:35,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:35,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 923 transitions.
[2023-08-28 18:00:35,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:35,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:35,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:35,962 INFO L175 Difference]: Start difference. First operand has 140 places, 144 transitions, 298 flow. Second operand 3 states and 923 transitions.
[2023-08-28 18:00:35,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 208 transitions, 695 flow
[2023-08-28 18:00:35,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 208 transitions, 695 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-28 18:00:35,967 INFO L231 Difference]: Finished difference. Result has 144 places, 150 transitions, 350 flow
[2023-08-28 18:00:35,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=144, PETRI_TRANSITIONS=150}
[2023-08-28 18:00:35,969 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -26 predicate places.
[2023-08-28 18:00:35,970 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 150 transitions, 350 flow
[2023-08-28 18:00:35,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:35,971 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:35,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:35,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-28 18:00:35,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:35,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1588068011, now seen corresponding path program 1 times
[2023-08-28 18:00:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297751573]
[2023-08-28 18:00:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:36,333 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-28 18:00:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297751573]
[2023-08-28 18:00:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297751573] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:36,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:36,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-28 18:00:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059070050]
[2023-08-28 18:00:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:36,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-28 18:00:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-28 18:00:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-08-28 18:00:36,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 516
[2023-08-28 18:00:36,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 150 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:36,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:36,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 516
[2023-08-28 18:00:36,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:38,996 INFO L130 PetriNetUnfolder]: 11023/21509 cut-off events.
[2023-08-28 18:00:38,997 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES.
[2023-08-28 18:00:39,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39790 conditions, 21509 events. 11023/21509 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 189873 event pairs, 7244 based on Foata normal form. 0/19330 useless extension candidates. Maximal degree in co-relation 39783. Up to 15547 conditions per place.
[2023-08-28 18:00:39,156 INFO L137 encePairwiseOnDemand]: 488/516 looper letters, 193 selfloop transitions, 82 changer transitions 0/338 dead transitions.
[2023-08-28 18:00:39,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 338 transitions, 1296 flow
[2023-08-28 18:00:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-28 18:00:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-28 18:00:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1703 transitions.
[2023-08-28 18:00:39,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5500645994832042
[2023-08-28 18:00:39,161 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1703 transitions.
[2023-08-28 18:00:39,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1703 transitions.
[2023-08-28 18:00:39,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:39,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1703 transitions.
[2023-08-28 18:00:39,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 283.8333333333333) internal successors, (1703), 6 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:39,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:39,176 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:39,177 INFO L175 Difference]: Start difference. First operand has 144 places, 150 transitions, 350 flow. Second operand 6 states and 1703 transitions.
[2023-08-28 18:00:39,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 338 transitions, 1296 flow
[2023-08-28 18:00:39,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 338 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-28 18:00:39,190 INFO L231 Difference]: Finished difference. Result has 151 places, 235 transitions, 844 flow
[2023-08-28 18:00:39,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=844, PETRI_PLACES=151, PETRI_TRANSITIONS=235}
[2023-08-28 18:00:39,193 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -19 predicate places.
[2023-08-28 18:00:39,194 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 235 transitions, 844 flow
[2023-08-28 18:00:39,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:39,196 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:39,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:39,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-28 18:00:39,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:39,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash -827472682, now seen corresponding path program 1 times
[2023-08-28 18:00:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:39,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486243886]
[2023-08-28 18:00:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:39,362 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-28 18:00:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486243886]
[2023-08-28 18:00:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486243886] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:00:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969174857]
[2023-08-28 18:00:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:00:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:00:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:00:39,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 516
[2023-08-28 18:00:39,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 235 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:39,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:39,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 516
[2023-08-28 18:00:39,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:42,674 INFO L130 PetriNetUnfolder]: 15441/34607 cut-off events.
[2023-08-28 18:00:42,675 INFO L131 PetriNetUnfolder]: For 3699/4361 co-relation queries the response was YES.
[2023-08-28 18:00:42,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68308 conditions, 34607 events. 15441/34607 cut-off events. For 3699/4361 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 361154 event pairs, 5373 based on Foata normal form. 134/32004 useless extension candidates. Maximal degree in co-relation 68297. Up to 13106 conditions per place.
[2023-08-28 18:00:42,939 INFO L137 encePairwiseOnDemand]: 496/516 looper letters, 200 selfloop transitions, 14 changer transitions 0/328 dead transitions.
[2023-08-28 18:00:42,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 328 transitions, 1552 flow
[2023-08-28 18:00:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:00:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:00:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions.
[2023-08-28 18:00:42,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.588501291989664
[2023-08-28 18:00:42,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 911 transitions.
[2023-08-28 18:00:42,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 911 transitions.
[2023-08-28 18:00:42,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:42,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 911 transitions.
[2023-08-28 18:00:42,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:42,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:42,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:42,951 INFO L175 Difference]: Start difference. First operand has 151 places, 235 transitions, 844 flow. Second operand 3 states and 911 transitions.
[2023-08-28 18:00:42,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 328 transitions, 1552 flow
[2023-08-28 18:00:42,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 328 transitions, 1552 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-28 18:00:42,976 INFO L231 Difference]: Finished difference. Result has 155 places, 249 transitions, 968 flow
[2023-08-28 18:00:42,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=155, PETRI_TRANSITIONS=249}
[2023-08-28 18:00:42,979 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -15 predicate places.
[2023-08-28 18:00:42,979 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 249 transitions, 968 flow
[2023-08-28 18:00:42,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:42,979 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:42,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:42,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-28 18:00:42,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:42,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1071307328, now seen corresponding path program 1 times
[2023-08-28 18:00:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577191564]
[2023-08-28 18:00:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:43,020 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-28 18:00:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:43,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577191564]
[2023-08-28 18:00:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577191564] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:00:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558878578]
[2023-08-28 18:00:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:43,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:00:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:00:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:00:43,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 516
[2023-08-28 18:00:43,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 249 transitions, 968 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:43,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:43,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 516
[2023-08-28 18:00:43,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:46,176 INFO L130 PetriNetUnfolder]: 13568/32753 cut-off events.
[2023-08-28 18:00:46,176 INFO L131 PetriNetUnfolder]: For 4910/5640 co-relation queries the response was YES.
[2023-08-28 18:00:46,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66172 conditions, 32753 events. 13568/32753 cut-off events. For 4910/5640 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 354885 event pairs, 8323 based on Foata normal form. 60/30213 useless extension candidates. Maximal degree in co-relation 66159. Up to 19564 conditions per place.
[2023-08-28 18:00:46,385 INFO L137 encePairwiseOnDemand]: 510/516 looper letters, 139 selfloop transitions, 7 changer transitions 0/284 dead transitions.
[2023-08-28 18:00:46,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 284 transitions, 1359 flow
[2023-08-28 18:00:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:00:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:00:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions.
[2023-08-28 18:00:46,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5749354005167958
[2023-08-28 18:00:46,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 890 transitions.
[2023-08-28 18:00:46,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 890 transitions.
[2023-08-28 18:00:46,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:46,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 890 transitions.
[2023-08-28 18:00:46,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:46,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:46,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:46,396 INFO L175 Difference]: Start difference. First operand has 155 places, 249 transitions, 968 flow. Second operand 3 states and 890 transitions.
[2023-08-28 18:00:46,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 284 transitions, 1359 flow
[2023-08-28 18:00:46,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 284 transitions, 1331 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-28 18:00:46,421 INFO L231 Difference]: Finished difference. Result has 157 places, 254 transitions, 996 flow
[2023-08-28 18:00:46,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=996, PETRI_PLACES=157, PETRI_TRANSITIONS=254}
[2023-08-28 18:00:46,422 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -13 predicate places.
[2023-08-28 18:00:46,423 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 254 transitions, 996 flow
[2023-08-28 18:00:46,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:46,423 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:46,423 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-28 18:00:46,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:46,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1664372254, now seen corresponding path program 1 times
[2023-08-28 18:00:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106766977]
[2023-08-28 18:00:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:00:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106766977]
[2023-08-28 18:00:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106766977] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:46,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-28 18:00:46,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494373484]
[2023-08-28 18:00:46,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:46,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-28 18:00:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-28 18:00:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-08-28 18:00:46,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 516
[2023-08-28 18:00:46,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 254 transitions, 996 flow. Second operand has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:46,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:46,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 516
[2023-08-28 18:00:46,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:51,726 INFO L130 PetriNetUnfolder]: 24904/48280 cut-off events.
[2023-08-28 18:00:51,726 INFO L131 PetriNetUnfolder]: For 11221/12267 co-relation queries the response was YES.
[2023-08-28 18:00:51,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108101 conditions, 48280 events. 24904/48280 cut-off events. For 11221/12267 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 472190 event pairs, 15619 based on Foata normal form. 406/45681 useless extension candidates. Maximal degree in co-relation 108087. Up to 37738 conditions per place.
[2023-08-28 18:00:52,051 INFO L137 encePairwiseOnDemand]: 489/516 looper letters, 287 selfloop transitions, 86 changer transitions 0/453 dead transitions.
[2023-08-28 18:00:52,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 453 transitions, 2322 flow
[2023-08-28 18:00:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-28 18:00:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-28 18:00:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1699 transitions.
[2023-08-28 18:00:52,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487726098191215
[2023-08-28 18:00:52,056 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1699 transitions.
[2023-08-28 18:00:52,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1699 transitions.
[2023-08-28 18:00:52,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:52,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1699 transitions.
[2023-08-28 18:00:52,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 283.1666666666667) internal successors, (1699), 6 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:52,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:52,066 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:52,066 INFO L175 Difference]: Start difference. First operand has 157 places, 254 transitions, 996 flow. Second operand 6 states and 1699 transitions.
[2023-08-28 18:00:52,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 453 transitions, 2322 flow
[2023-08-28 18:00:52,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 453 transitions, 2292 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-28 18:00:52,108 INFO L231 Difference]: Finished difference. Result has 164 places, 339 transitions, 1571 flow
[2023-08-28 18:00:52,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1571, PETRI_PLACES=164, PETRI_TRANSITIONS=339}
[2023-08-28 18:00:52,109 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -6 predicate places.
[2023-08-28 18:00:52,109 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 339 transitions, 1571 flow
[2023-08-28 18:00:52,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:52,110 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:52,110 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:52,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-28 18:00:52,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:52,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash -469628713, now seen corresponding path program 1 times
[2023-08-28 18:00:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390734165]
[2023-08-28 18:00:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:00:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390734165]
[2023-08-28 18:00:52,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390734165] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:52,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:52,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-28 18:00:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935969282]
[2023-08-28 18:00:52,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:52,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-28 18:00:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-28 18:00:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-08-28 18:00:52,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 516
[2023-08-28 18:00:52,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 339 transitions, 1571 flow. Second operand has 8 states, 8 states have (on average 238.625) internal successors, (1909), 8 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:52,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:00:52,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 516
[2023-08-28 18:00:52,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:00:58,983 INFO L130 PetriNetUnfolder]: 24998/48432 cut-off events.
[2023-08-28 18:00:58,983 INFO L131 PetriNetUnfolder]: For 19746/20770 co-relation queries the response was YES.
[2023-08-28 18:00:59,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120043 conditions, 48432 events. 24998/48432 cut-off events. For 19746/20770 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 474254 event pairs, 15313 based on Foata normal form. 290/45991 useless extension candidates. Maximal degree in co-relation 120025. Up to 36697 conditions per place.
[2023-08-28 18:00:59,379 INFO L137 encePairwiseOnDemand]: 489/516 looper letters, 281 selfloop transitions, 98 changer transitions 0/459 dead transitions.
[2023-08-28 18:00:59,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 459 transitions, 2718 flow
[2023-08-28 18:00:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-28 18:00:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-28 18:00:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1934 transitions.
[2023-08-28 18:00:59,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535437430786268
[2023-08-28 18:00:59,384 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1934 transitions.
[2023-08-28 18:00:59,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1934 transitions.
[2023-08-28 18:00:59,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:00:59,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1934 transitions.
[2023-08-28 18:00:59,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 276.2857142857143) internal successors, (1934), 7 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:59,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:59,394 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:59,394 INFO L175 Difference]: Start difference. First operand has 164 places, 339 transitions, 1571 flow. Second operand 7 states and 1934 transitions.
[2023-08-28 18:00:59,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 459 transitions, 2718 flow
[2023-08-28 18:00:59,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 459 transitions, 2710 flow, removed 4 selfloop flow, removed 0 redundant places.
[2023-08-28 18:00:59,500 INFO L231 Difference]: Finished difference. Result has 175 places, 352 transitions, 2045 flow
[2023-08-28 18:00:59,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2045, PETRI_PLACES=175, PETRI_TRANSITIONS=352}
[2023-08-28 18:00:59,501 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 5 predicate places.
[2023-08-28 18:00:59,501 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 352 transitions, 2045 flow
[2023-08-28 18:00:59,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 238.625) internal successors, (1909), 8 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:00:59,502 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:00:59,502 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:00:59,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-28 18:00:59,502 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:00:59,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:00:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 275521974, now seen corresponding path program 1 times
[2023-08-28 18:00:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:00:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480817855]
[2023-08-28 18:00:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:00:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:00:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:00:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:00:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:00:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480817855]
[2023-08-28 18:00:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480817855] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:00:59,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:00:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-28 18:00:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559910945]
[2023-08-28 18:00:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:00:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-28 18:00:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:00:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-28 18:00:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2023-08-28 18:01:00,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 516
[2023-08-28 18:01:00,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 352 transitions, 2045 flow. Second operand has 8 states, 8 states have (on average 239.625) internal successors, (1917), 8 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:00,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:00,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 516
[2023-08-28 18:01:00,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:06,493 INFO L130 PetriNetUnfolder]: 25106/48618 cut-off events.
[2023-08-28 18:01:06,494 INFO L131 PetriNetUnfolder]: For 32000/33172 co-relation queries the response was YES.
[2023-08-28 18:01:06,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126952 conditions, 48618 events. 25106/48618 cut-off events. For 32000/33172 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 475557 event pairs, 15603 based on Foata normal form. 264/46161 useless extension candidates. Maximal degree in co-relation 126928. Up to 37819 conditions per place.
[2023-08-28 18:01:06,942 INFO L137 encePairwiseOnDemand]: 490/516 looper letters, 307 selfloop transitions, 95 changer transitions 0/482 dead transitions.
[2023-08-28 18:01:06,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 482 transitions, 3369 flow
[2023-08-28 18:01:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-28 18:01:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-28 18:01:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1937 transitions.
[2023-08-28 18:01:06,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362679955703211
[2023-08-28 18:01:06,948 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1937 transitions.
[2023-08-28 18:01:06,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1937 transitions.
[2023-08-28 18:01:06,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:06,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1937 transitions.
[2023-08-28 18:01:06,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 276.7142857142857) internal successors, (1937), 7 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:06,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:06,959 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:06,959 INFO L175 Difference]: Start difference. First operand has 175 places, 352 transitions, 2045 flow. Second operand 7 states and 1937 transitions.
[2023-08-28 18:01:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 482 transitions, 3369 flow
[2023-08-28 18:01:07,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 482 transitions, 3368 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:01:07,287 INFO L231 Difference]: Finished difference. Result has 184 places, 364 transitions, 2452 flow
[2023-08-28 18:01:07,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2452, PETRI_PLACES=184, PETRI_TRANSITIONS=364}
[2023-08-28 18:01:07,288 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places.
[2023-08-28 18:01:07,288 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 364 transitions, 2452 flow
[2023-08-28 18:01:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.625) internal successors, (1917), 8 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:07,289 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:07,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:07,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-28 18:01:07,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:07,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1601493271, now seen corresponding path program 1 times
[2023-08-28 18:01:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412129748]
[2023-08-28 18:01:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:07,338 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-28 18:01:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412129748]
[2023-08-28 18:01:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412129748] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:01:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:01:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-28 18:01:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690106228]
[2023-08-28 18:01:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:01:07,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-28 18:01:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-28 18:01:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-28 18:01:07,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 516
[2023-08-28 18:01:07,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 364 transitions, 2452 flow. Second operand has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:07,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:07,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 516
[2023-08-28 18:01:07,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:12,420 INFO L130 PetriNetUnfolder]: 16380/40328 cut-off events.
[2023-08-28 18:01:12,420 INFO L131 PetriNetUnfolder]: For 30084/31580 co-relation queries the response was YES.
[2023-08-28 18:01:12,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105051 conditions, 40328 events. 16380/40328 cut-off events. For 30084/31580 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 459154 event pairs, 3162 based on Foata normal form. 610/38314 useless extension candidates. Maximal degree in co-relation 105023. Up to 16184 conditions per place.
[2023-08-28 18:01:12,840 INFO L137 encePairwiseOnDemand]: 506/516 looper letters, 313 selfloop transitions, 14 changer transitions 0/528 dead transitions.
[2023-08-28 18:01:12,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 528 transitions, 3999 flow
[2023-08-28 18:01:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-28 18:01:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-28 18:01:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1466 transitions.
[2023-08-28 18:01:12,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568217054263566
[2023-08-28 18:01:12,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1466 transitions.
[2023-08-28 18:01:12,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1466 transitions.
[2023-08-28 18:01:12,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:12,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1466 transitions.
[2023-08-28 18:01:12,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 293.2) internal successors, (1466), 5 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:12,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 516.0) internal successors, (3096), 6 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:12,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 516.0) internal successors, (3096), 6 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:12,855 INFO L175 Difference]: Start difference. First operand has 184 places, 364 transitions, 2452 flow. Second operand 5 states and 1466 transitions.
[2023-08-28 18:01:12,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 528 transitions, 3999 flow
[2023-08-28 18:01:13,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 528 transitions, 3994 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-08-28 18:01:13,101 INFO L231 Difference]: Finished difference. Result has 191 places, 376 transitions, 2599 flow
[2023-08-28 18:01:13,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2599, PETRI_PLACES=191, PETRI_TRANSITIONS=376}
[2023-08-28 18:01:13,102 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 21 predicate places.
[2023-08-28 18:01:13,102 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 376 transitions, 2599 flow
[2023-08-28 18:01:13,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:13,103 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:13,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:13,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-08-28 18:01:13,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:13,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2093701163, now seen corresponding path program 1 times
[2023-08-28 18:01:13,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:13,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783048628]
[2023-08-28 18:01:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:01:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783048628]
[2023-08-28 18:01:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783048628] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:01:13,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:01:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:01:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486294679]
[2023-08-28 18:01:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:01:13,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:01:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:01:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:01:13,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 516
[2023-08-28 18:01:13,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 376 transitions, 2599 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:13,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:13,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 516
[2023-08-28 18:01:13,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:18,551 INFO L130 PetriNetUnfolder]: 17135/41491 cut-off events.
[2023-08-28 18:01:18,551 INFO L131 PetriNetUnfolder]: For 37822/39667 co-relation queries the response was YES.
[2023-08-28 18:01:18,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109782 conditions, 41491 events. 17135/41491 cut-off events. For 37822/39667 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 469350 event pairs, 9243 based on Foata normal form. 347/39255 useless extension candidates. Maximal degree in co-relation 109751. Up to 24202 conditions per place.
[2023-08-28 18:01:18,945 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 212 selfloop transitions, 8 changer transitions 0/413 dead transitions.
[2023-08-28 18:01:18,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 413 transitions, 3204 flow
[2023-08-28 18:01:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:01:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:01:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions.
[2023-08-28 18:01:18,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729974160206718
[2023-08-28 18:01:18,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions.
[2023-08-28 18:01:18,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions.
[2023-08-28 18:01:18,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:18,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions.
[2023-08-28 18:01:18,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:18,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:18,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:18,953 INFO L175 Difference]: Start difference. First operand has 191 places, 376 transitions, 2599 flow. Second operand 3 states and 887 transitions.
[2023-08-28 18:01:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 413 transitions, 3204 flow
[2023-08-28 18:01:19,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 413 transitions, 3204 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-28 18:01:19,105 INFO L231 Difference]: Finished difference. Result has 194 places, 380 transitions, 2651 flow
[2023-08-28 18:01:19,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2651, PETRI_PLACES=194, PETRI_TRANSITIONS=380}
[2023-08-28 18:01:19,106 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 24 predicate places.
[2023-08-28 18:01:19,106 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 380 transitions, 2651 flow
[2023-08-28 18:01:19,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:19,106 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:19,107 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:19,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-08-28 18:01:19,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:19,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash -90330492, now seen corresponding path program 1 times
[2023-08-28 18:01:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919434180]
[2023-08-28 18:01:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:19,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-08-28 18:01:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919434180]
[2023-08-28 18:01:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919434180] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:01:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:01:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-28 18:01:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23116128]
[2023-08-28 18:01:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:01:19,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:01:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:19,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:01:19,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:01:19,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 516
[2023-08-28 18:01:19,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 380 transitions, 2651 flow. Second operand has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:19,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:19,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 516
[2023-08-28 18:01:19,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:24,541 INFO L130 PetriNetUnfolder]: 17650/42317 cut-off events.
[2023-08-28 18:01:24,541 INFO L131 PetriNetUnfolder]: For 39745/41935 co-relation queries the response was YES.
[2023-08-28 18:01:24,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113230 conditions, 42317 events. 17650/42317 cut-off events. For 39745/41935 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 475545 event pairs, 7909 based on Foata normal form. 500/40317 useless extension candidates. Maximal degree in co-relation 113197. Up to 24101 conditions per place.
[2023-08-28 18:01:24,918 INFO L137 encePairwiseOnDemand]: 503/516 looper letters, 219 selfloop transitions, 22 changer transitions 0/445 dead transitions.
[2023-08-28 18:01:24,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 445 transitions, 3406 flow
[2023-08-28 18:01:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:01:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:01:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions.
[2023-08-28 18:01:24,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930232558139535
[2023-08-28 18:01:24,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 918 transitions.
[2023-08-28 18:01:24,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 918 transitions.
[2023-08-28 18:01:24,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:24,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 918 transitions.
[2023-08-28 18:01:24,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:24,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:24,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:24,926 INFO L175 Difference]: Start difference. First operand has 194 places, 380 transitions, 2651 flow. Second operand 3 states and 918 transitions.
[2023-08-28 18:01:24,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 445 transitions, 3406 flow
[2023-08-28 18:01:25,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 445 transitions, 3397 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:01:25,060 INFO L231 Difference]: Finished difference. Result has 196 places, 392 transitions, 2781 flow
[2023-08-28 18:01:25,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2643, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2781, PETRI_PLACES=196, PETRI_TRANSITIONS=392}
[2023-08-28 18:01:25,061 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 26 predicate places.
[2023-08-28 18:01:25,061 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 392 transitions, 2781 flow
[2023-08-28 18:01:25,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:25,061 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:25,062 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:25,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-08-28 18:01:25,062 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:25,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -522902276, now seen corresponding path program 2 times
[2023-08-28 18:01:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451001546]
[2023-08-28 18:01:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-08-28 18:01:25,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451001546]
[2023-08-28 18:01:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451001546] provided 0 perfect and 1 imperfect interpolant sequences
[2023-08-28 18:01:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008600318]
[2023-08-28 18:01:25,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-08-28 18:01:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-08-28 18:01:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-28 18:01:25,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-08-28 18:01:25,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-08-28 18:01:25,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-28 18:01:25,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-28 18:01:25,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-08-28 18:01:25,578 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-28 18:01:25,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-08-28 18:01:25,792 INFO L190 IndexEqualityManager]: detected not equals via solver
[2023-08-28 18:01:25,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:01:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-08-28 18:01:25,845 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2023-08-28 18:01:25,872 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_417) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0))) is different from false
[2023-08-28 18:01:25,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-08-28 18:01:25,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2023-08-28 18:01:25,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2023-08-28 18:01:25,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2023-08-28 18:01:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-08-28 18:01:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008600318] provided 0 perfect and 2 imperfect interpolant sequences
[2023-08-28 18:01:25,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-08-28 18:01:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10
[2023-08-28 18:01:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609921176]
[2023-08-28 18:01:25,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-08-28 18:01:25,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-08-28 18:01:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-08-28 18:01:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=58, Unknown=1, NotChecked=16, Total=110
[2023-08-28 18:01:25,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 516
[2023-08-28 18:01:25,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 392 transitions, 2781 flow. Second operand has 11 states, 11 states have (on average 234.9090909090909) internal successors, (2584), 11 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:25,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:25,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 516
[2023-08-28 18:01:25,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:35,752 INFO L130 PetriNetUnfolder]: 34953/67915 cut-off events.
[2023-08-28 18:01:35,752 INFO L131 PetriNetUnfolder]: For 115672/117399 co-relation queries the response was YES.
[2023-08-28 18:01:36,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220564 conditions, 67915 events. 34953/67915 cut-off events. For 115672/117399 co-relation queries the response was YES. Maximal size of possible extension queue 1868. Compared 694000 event pairs, 15533 based on Foata normal form. 465/65346 useless extension candidates. Maximal degree in co-relation 220530. Up to 46863 conditions per place.
[2023-08-28 18:01:36,504 INFO L137 encePairwiseOnDemand]: 504/516 looper letters, 446 selfloop transitions, 63 changer transitions 0/626 dead transitions.
[2023-08-28 18:01:36,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 626 transitions, 5647 flow
[2023-08-28 18:01:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-28 18:01:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-28 18:01:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1088 transitions.
[2023-08-28 18:01:36,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365
[2023-08-28 18:01:36,507 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1088 transitions.
[2023-08-28 18:01:36,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1088 transitions.
[2023-08-28 18:01:36,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:36,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1088 transitions.
[2023-08-28 18:01:36,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:36,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:36,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:36,512 INFO L175 Difference]: Start difference. First operand has 196 places, 392 transitions, 2781 flow. Second operand 4 states and 1088 transitions.
[2023-08-28 18:01:36,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 626 transitions, 5647 flow
[2023-08-28 18:01:36,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 626 transitions, 5625 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:01:37,036 INFO L231 Difference]: Finished difference. Result has 199 places, 434 transitions, 3339 flow
[2023-08-28 18:01:37,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3339, PETRI_PLACES=199, PETRI_TRANSITIONS=434}
[2023-08-28 18:01:37,045 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 29 predicate places.
[2023-08-28 18:01:37,045 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 434 transitions, 3339 flow
[2023-08-28 18:01:37,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 234.9090909090909) internal successors, (2584), 11 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:37,046 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:37,046 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:37,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-08-28 18:01:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-08-28 18:01:37,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:37,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -275666684, now seen corresponding path program 3 times
[2023-08-28 18:01:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:37,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942470874]
[2023-08-28 18:01:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:01:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942470874]
[2023-08-28 18:01:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942470874] provided 0 perfect and 1 imperfect interpolant sequences
[2023-08-28 18:01:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287489995]
[2023-08-28 18:01:37,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-08-28 18:01:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-08-28 18:01:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-28 18:01:37,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-08-28 18:01:37,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-08-28 18:01:37,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-08-28 18:01:37,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-28 18:01:37,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-08-28 18:01:37,573 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-28 18:01:37,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-08-28 18:01:37,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-08-28 18:01:37,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:01:37,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2023-08-28 18:01:37,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:01:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:01:37,758 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2023-08-28 18:01:37,785 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0))) is different from false
[2023-08-28 18:01:37,854 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_494))) (let ((.cse1 (select .cse0 |c_~#m2~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#m2~0.base| (store .cse1 |c_~#m2~0.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_497) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)) (not (= (select .cse1 |c_~#m2~0.offset|) 0)))))) is different from false
[2023-08-28 18:01:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-08-28 18:01:37,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287489995] provided 0 perfect and 2 imperfect interpolant sequences
[2023-08-28 18:01:37,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-08-28 18:01:37,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 11
[2023-08-28 18:01:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542987526]
[2023-08-28 18:01:37,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-08-28 18:01:37,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-08-28 18:01:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-08-28 18:01:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=56, Unknown=2, NotChecked=34, Total=132
[2023-08-28 18:01:37,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 516
[2023-08-28 18:01:37,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 434 transitions, 3339 flow. Second operand has 12 states, 12 states have (on average 254.33333333333334) internal successors, (3052), 12 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:37,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:37,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 516
[2023-08-28 18:01:37,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:44,408 INFO L130 PetriNetUnfolder]: 19786/47348 cut-off events.
[2023-08-28 18:01:44,408 INFO L131 PetriNetUnfolder]: For 76590/79378 co-relation queries the response was YES.
[2023-08-28 18:01:44,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148742 conditions, 47348 events. 19786/47348 cut-off events. For 76590/79378 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 540208 event pairs, 4255 based on Foata normal form. 607/45162 useless extension candidates. Maximal degree in co-relation 148707. Up to 26756 conditions per place.
[2023-08-28 18:01:44,868 INFO L137 encePairwiseOnDemand]: 503/516 looper letters, 268 selfloop transitions, 39 changer transitions 0/509 dead transitions.
[2023-08-28 18:01:44,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 509 transitions, 4314 flow
[2023-08-28 18:01:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-28 18:01:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-28 18:01:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1645 transitions.
[2023-08-28 18:01:44,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313307493540051
[2023-08-28 18:01:44,872 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1645 transitions.
[2023-08-28 18:01:44,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1645 transitions.
[2023-08-28 18:01:44,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:44,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1645 transitions.
[2023-08-28 18:01:44,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:44,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:44,878 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:44,879 INFO L175 Difference]: Start difference. First operand has 199 places, 434 transitions, 3339 flow. Second operand 6 states and 1645 transitions.
[2023-08-28 18:01:44,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 509 transitions, 4314 flow
[2023-08-28 18:01:45,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 509 transitions, 4313 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:01:45,064 INFO L231 Difference]: Finished difference. Result has 204 places, 450 transitions, 3577 flow
[2023-08-28 18:01:45,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=3325, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3577, PETRI_PLACES=204, PETRI_TRANSITIONS=450}
[2023-08-28 18:01:45,064 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 34 predicate places.
[2023-08-28 18:01:45,065 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 450 transitions, 3577 flow
[2023-08-28 18:01:45,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 254.33333333333334) internal successors, (3052), 12 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:45,065 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:45,066 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:45,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-08-28 18:01:45,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-08-28 18:01:45,267 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:45,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1022531264, now seen corresponding path program 4 times
[2023-08-28 18:01:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300130688]
[2023-08-28 18:01:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:01:45,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:45,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300130688]
[2023-08-28 18:01:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300130688] provided 0 perfect and 1 imperfect interpolant sequences
[2023-08-28 18:01:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100720303]
[2023-08-28 18:01:45,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-08-28 18:01:45,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-08-28 18:01:45,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-28 18:01:45,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-08-28 18:01:45,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-08-28 18:01:45,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-08-28 18:01:45,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-28 18:01:45,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjunts are in the unsatisfiable core
[2023-08-28 18:01:45,619 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-28 18:01:45,634 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-08-28 18:01:45,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-08-28 18:01:45,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-08-28 18:01:45,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:01:45,761 INFO L190 IndexEqualityManager]: detected not equals via solver
[2023-08-28 18:01:45,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:01:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:01:45,808 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2023-08-28 18:01:45,828 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_577) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0))) is different from false
[2023-08-28 18:01:45,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-08-28 18:01:45,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23
[2023-08-28 18:01:45,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119
[2023-08-28 18:01:45,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2023-08-28 18:01:45,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2023-08-28 18:01:45,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2023-08-28 18:01:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-08-28 18:01:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100720303] provided 0 perfect and 2 imperfect interpolant sequences
[2023-08-28 18:01:45,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-08-28 18:01:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13
[2023-08-28 18:01:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24001086]
[2023-08-28 18:01:45,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-08-28 18:01:45,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2023-08-28 18:01:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2023-08-28 18:01:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=105, Unknown=2, NotChecked=22, Total=182
[2023-08-28 18:01:45,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 516
[2023-08-28 18:01:45,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 450 transitions, 3577 flow. Second operand has 14 states, 14 states have (on average 230.28571428571428) internal successors, (3224), 14 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:45,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:45,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 516
[2023-08-28 18:01:45,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:52,734 INFO L130 PetriNetUnfolder]: 23228/46158 cut-off events.
[2023-08-28 18:01:52,735 INFO L131 PetriNetUnfolder]: For 95062/95897 co-relation queries the response was YES.
[2023-08-28 18:01:53,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158760 conditions, 46158 events. 23228/46158 cut-off events. For 95062/95897 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 462880 event pairs, 10830 based on Foata normal form. 211/43961 useless extension candidates. Maximal degree in co-relation 158724. Up to 25332 conditions per place.
[2023-08-28 18:01:53,187 INFO L137 encePairwiseOnDemand]: 505/516 looper letters, 316 selfloop transitions, 85 changer transitions 0/504 dead transitions.
[2023-08-28 18:01:53,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 504 transitions, 4511 flow
[2023-08-28 18:01:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-28 18:01:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-28 18:01:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1072 transitions.
[2023-08-28 18:01:53,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403
[2023-08-28 18:01:53,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1072 transitions.
[2023-08-28 18:01:53,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1072 transitions.
[2023-08-28 18:01:53,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:53,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1072 transitions.
[2023-08-28 18:01:53,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:53,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:53,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:53,194 INFO L175 Difference]: Start difference. First operand has 204 places, 450 transitions, 3577 flow. Second operand 4 states and 1072 transitions.
[2023-08-28 18:01:53,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 504 transitions, 4511 flow
[2023-08-28 18:01:53,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 504 transitions, 3753 flow, removed 79 selfloop flow, removed 22 redundant places.
[2023-08-28 18:01:53,519 INFO L231 Difference]: Finished difference. Result has 182 places, 371 transitions, 2606 flow
[2023-08-28 18:01:53,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2606, PETRI_PLACES=182, PETRI_TRANSITIONS=371}
[2023-08-28 18:01:53,520 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 12 predicate places.
[2023-08-28 18:01:53,520 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 371 transitions, 2606 flow
[2023-08-28 18:01:53,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 230.28571428571428) internal successors, (3224), 14 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:53,521 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:53,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:53,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-08-28 18:01:53,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-08-28 18:01:53,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:53,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2083154550, now seen corresponding path program 1 times
[2023-08-28 18:01:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127710086]
[2023-08-28 18:01:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:53,800 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-28 18:01:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127710086]
[2023-08-28 18:01:53,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127710086] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:01:53,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:01:53,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:01:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887543919]
[2023-08-28 18:01:53,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:01:53,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:01:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:53,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:01:53,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:01:53,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 516
[2023-08-28 18:01:53,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 371 transitions, 2606 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:53,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:53,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 516
[2023-08-28 18:01:53,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:01:57,616 INFO L130 PetriNetUnfolder]: 11800/28847 cut-off events.
[2023-08-28 18:01:57,616 INFO L131 PetriNetUnfolder]: For 44729/45315 co-relation queries the response was YES.
[2023-08-28 18:01:57,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86933 conditions, 28847 events. 11800/28847 cut-off events. For 44729/45315 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 319110 event pairs, 2956 based on Foata normal form. 241/27529 useless extension candidates. Maximal degree in co-relation 86906. Up to 16565 conditions per place.
[2023-08-28 18:01:57,946 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 263 selfloop transitions, 3 changer transitions 0/420 dead transitions.
[2023-08-28 18:01:57,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 420 transitions, 3479 flow
[2023-08-28 18:01:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:01:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:01:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions.
[2023-08-28 18:01:57,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5768733850129198
[2023-08-28 18:01:57,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 893 transitions.
[2023-08-28 18:01:57,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 893 transitions.
[2023-08-28 18:01:57,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:01:57,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 893 transitions.
[2023-08-28 18:01:57,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:57,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:57,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:57,951 INFO L175 Difference]: Start difference. First operand has 182 places, 371 transitions, 2606 flow. Second operand 3 states and 893 transitions.
[2023-08-28 18:01:57,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 420 transitions, 3479 flow
[2023-08-28 18:01:58,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 420 transitions, 3423 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-28 18:01:58,096 INFO L231 Difference]: Finished difference. Result has 183 places, 373 transitions, 2579 flow
[2023-08-28 18:01:58,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2579, PETRI_PLACES=183, PETRI_TRANSITIONS=373}
[2023-08-28 18:01:58,097 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 13 predicate places.
[2023-08-28 18:01:58,097 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 373 transitions, 2579 flow
[2023-08-28 18:01:58,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:58,097 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:01:58,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:01:58,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-08-28 18:01:58,098 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:01:58,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:01:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1087344695, now seen corresponding path program 1 times
[2023-08-28 18:01:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:01:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045034876]
[2023-08-28 18:01:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:01:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:01:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:01:58,138 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-28 18:01:58,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:01:58,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045034876]
[2023-08-28 18:01:58,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045034876] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:01:58,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:01:58,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:01:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302373569]
[2023-08-28 18:01:58,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:01:58,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:01:58,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:01:58,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:01:58,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:01:58,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 516
[2023-08-28 18:01:58,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 373 transitions, 2579 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:01:58,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:01:58,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 516
[2023-08-28 18:01:58,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:01,853 INFO L130 PetriNetUnfolder]: 13024/30379 cut-off events.
[2023-08-28 18:02:01,853 INFO L131 PetriNetUnfolder]: For 50420/51614 co-relation queries the response was YES.
[2023-08-28 18:02:02,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92216 conditions, 30379 events. 13024/30379 cut-off events. For 50420/51614 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 330231 event pairs, 6738 based on Foata normal form. 228/28987 useless extension candidates. Maximal degree in co-relation 92188. Up to 19158 conditions per place.
[2023-08-28 18:02:02,136 INFO L137 encePairwiseOnDemand]: 509/516 looper letters, 267 selfloop transitions, 11 changer transitions 0/421 dead transitions.
[2023-08-28 18:02:02,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 421 transitions, 3393 flow
[2023-08-28 18:02:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions.
[2023-08-28 18:02:02,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5678294573643411
[2023-08-28 18:02:02,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 879 transitions.
[2023-08-28 18:02:02,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 879 transitions.
[2023-08-28 18:02:02,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:02,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 879 transitions.
[2023-08-28 18:02:02,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:02,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:02,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:02,140 INFO L175 Difference]: Start difference. First operand has 183 places, 373 transitions, 2579 flow. Second operand 3 states and 879 transitions.
[2023-08-28 18:02:02,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 421 transitions, 3393 flow
[2023-08-28 18:02:02,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 421 transitions, 3390 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:02:02,446 INFO L231 Difference]: Finished difference. Result has 185 places, 382 transitions, 2663 flow
[2023-08-28 18:02:02,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2576, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2663, PETRI_PLACES=185, PETRI_TRANSITIONS=382}
[2023-08-28 18:02:02,447 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 15 predicate places.
[2023-08-28 18:02:02,447 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 382 transitions, 2663 flow
[2023-08-28 18:02:02,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:02,447 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:02,447 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:02,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-08-28 18:02:02,447 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:02,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1440526511, now seen corresponding path program 1 times
[2023-08-28 18:02:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633946672]
[2023-08-28 18:02:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:02,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633946672]
[2023-08-28 18:02:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633946672] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-28 18:02:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652331567]
[2023-08-28 18:02:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:02,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:02:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:02:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:02:02,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 516
[2023-08-28 18:02:02,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 382 transitions, 2663 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:02,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:02,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 516
[2023-08-28 18:02:02,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:04,112 INFO L130 PetriNetUnfolder]: 4979/12563 cut-off events.
[2023-08-28 18:02:04,113 INFO L131 PetriNetUnfolder]: For 25250/25562 co-relation queries the response was YES.
[2023-08-28 18:02:04,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36140 conditions, 12563 events. 4979/12563 cut-off events. For 25250/25562 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 122353 event pairs, 2005 based on Foata normal form. 325/12058 useless extension candidates. Maximal degree in co-relation 36111. Up to 7782 conditions per place.
[2023-08-28 18:02:04,199 INFO L137 encePairwiseOnDemand]: 512/516 looper letters, 92 selfloop transitions, 2 changer transitions 0/194 dead transitions.
[2023-08-28 18:02:04,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 194 transitions, 1262 flow
[2023-08-28 18:02:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions.
[2023-08-28 18:02:04,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5626614987080103
[2023-08-28 18:02:04,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 871 transitions.
[2023-08-28 18:02:04,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions.
[2023-08-28 18:02:04,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:04,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions.
[2023-08-28 18:02:04,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:04,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:04,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:04,205 INFO L175 Difference]: Start difference. First operand has 185 places, 382 transitions, 2663 flow. Second operand 3 states and 871 transitions.
[2023-08-28 18:02:04,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 194 transitions, 1262 flow
[2023-08-28 18:02:04,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 194 transitions, 1110 flow, removed 45 selfloop flow, removed 23 redundant places.
[2023-08-28 18:02:04,239 INFO L231 Difference]: Finished difference. Result has 162 places, 190 transitions, 901 flow
[2023-08-28 18:02:04,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=162, PETRI_TRANSITIONS=190}
[2023-08-28 18:02:04,240 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -8 predicate places.
[2023-08-28 18:02:04,240 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 190 transitions, 901 flow
[2023-08-28 18:02:04,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:04,241 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:04,241 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:04,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-08-28 18:02:04,241 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:04,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash -573352910, now seen corresponding path program 1 times
[2023-08-28 18:02:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975300140]
[2023-08-28 18:02:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:04,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975300140]
[2023-08-28 18:02:04,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975300140] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:04,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:04,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:02:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868637060]
[2023-08-28 18:02:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:04,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:02:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:02:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:02:04,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 516
[2023-08-28 18:02:04,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 190 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:04,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:04,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 516
[2023-08-28 18:02:04,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:05,816 INFO L130 PetriNetUnfolder]: 6399/14473 cut-off events.
[2023-08-28 18:02:05,816 INFO L131 PetriNetUnfolder]: For 24671/25252 co-relation queries the response was YES.
[2023-08-28 18:02:05,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39241 conditions, 14473 events. 6399/14473 cut-off events. For 24671/25252 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 135305 event pairs, 3977 based on Foata normal form. 148/13777 useless extension candidates. Maximal degree in co-relation 39222. Up to 9725 conditions per place.
[2023-08-28 18:02:05,922 INFO L137 encePairwiseOnDemand]: 508/516 looper letters, 135 selfloop transitions, 16 changer transitions 0/227 dead transitions.
[2023-08-28 18:02:05,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 227 transitions, 1395 flow
[2023-08-28 18:02:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions.
[2023-08-28 18:02:05,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645994832041343
[2023-08-28 18:02:05,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 874 transitions.
[2023-08-28 18:02:05,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 874 transitions.
[2023-08-28 18:02:05,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:05,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 874 transitions.
[2023-08-28 18:02:05,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:05,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:05,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:05,928 INFO L175 Difference]: Start difference. First operand has 162 places, 190 transitions, 901 flow. Second operand 3 states and 874 transitions.
[2023-08-28 18:02:05,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 227 transitions, 1395 flow
[2023-08-28 18:02:05,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 227 transitions, 1383 flow, removed 3 selfloop flow, removed 3 redundant places.
[2023-08-28 18:02:05,936 INFO L231 Difference]: Finished difference. Result has 163 places, 200 transitions, 1025 flow
[2023-08-28 18:02:05,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=163, PETRI_TRANSITIONS=200}
[2023-08-28 18:02:05,936 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places.
[2023-08-28 18:02:05,936 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 200 transitions, 1025 flow
[2023-08-28 18:02:05,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:05,937 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:05,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:05,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-08-28 18:02:05,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:05,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1006636140, now seen corresponding path program 1 times
[2023-08-28 18:02:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044925700]
[2023-08-28 18:02:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:05,992 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-28 18:02:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044925700]
[2023-08-28 18:02:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044925700] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:02:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332129539]
[2023-08-28 18:02:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:05,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:02:05,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:05,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:02:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:02:06,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 516
[2023-08-28 18:02:06,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 200 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:06,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:06,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 516
[2023-08-28 18:02:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:07,569 INFO L130 PetriNetUnfolder]: 5760/13529 cut-off events.
[2023-08-28 18:02:07,569 INFO L131 PetriNetUnfolder]: For 26728/27176 co-relation queries the response was YES.
[2023-08-28 18:02:07,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36985 conditions, 13529 events. 5760/13529 cut-off events. For 26728/27176 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 127376 event pairs, 3563 based on Foata normal form. 120/12756 useless extension candidates. Maximal degree in co-relation 36967. Up to 8629 conditions per place.
[2023-08-28 18:02:07,656 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 123 selfloop transitions, 4 changer transitions 0/231 dead transitions.
[2023-08-28 18:02:07,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 231 transitions, 1434 flow
[2023-08-28 18:02:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions.
[2023-08-28 18:02:07,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652454780361758
[2023-08-28 18:02:07,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 875 transitions.
[2023-08-28 18:02:07,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 875 transitions.
[2023-08-28 18:02:07,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:07,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 875 transitions.
[2023-08-28 18:02:07,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.6666666666667) internal successors, (875), 3 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:07,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:07,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:07,661 INFO L175 Difference]: Start difference. First operand has 163 places, 200 transitions, 1025 flow. Second operand 3 states and 875 transitions.
[2023-08-28 18:02:07,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 231 transitions, 1434 flow
[2023-08-28 18:02:07,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 231 transitions, 1400 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-28 18:02:07,672 INFO L231 Difference]: Finished difference. Result has 164 places, 203 transitions, 1019 flow
[2023-08-28 18:02:07,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1019, PETRI_PLACES=164, PETRI_TRANSITIONS=203}
[2023-08-28 18:02:07,673 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -6 predicate places.
[2023-08-28 18:02:07,673 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 203 transitions, 1019 flow
[2023-08-28 18:02:07,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:07,673 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:07,673 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:07,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-08-28 18:02:07,674 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:07,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1654103425, now seen corresponding path program 1 times
[2023-08-28 18:02:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:07,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473375404]
[2023-08-28 18:02:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473375404]
[2023-08-28 18:02:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473375404] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:02:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348798266]
[2023-08-28 18:02:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:07,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:02:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:02:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:02:07,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 516
[2023-08-28 18:02:07,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 203 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:07,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:07,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 516
[2023-08-28 18:02:07,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:09,382 INFO L130 PetriNetUnfolder]: 6074/13925 cut-off events.
[2023-08-28 18:02:09,382 INFO L131 PetriNetUnfolder]: For 26581/27097 co-relation queries the response was YES.
[2023-08-28 18:02:09,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38817 conditions, 13925 events. 6074/13925 cut-off events. For 26581/27097 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 129345 event pairs, 3749 based on Foata normal form. 126/13122 useless extension candidates. Maximal degree in co-relation 38798. Up to 9151 conditions per place.
[2023-08-28 18:02:09,479 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 127 selfloop transitions, 5 changer transitions 0/235 dead transitions.
[2023-08-28 18:02:09,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 235 transitions, 1452 flow
[2023-08-28 18:02:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 876 transitions.
[2023-08-28 18:02:09,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171
[2023-08-28 18:02:09,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 876 transitions.
[2023-08-28 18:02:09,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 876 transitions.
[2023-08-28 18:02:09,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:09,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 876 transitions.
[2023-08-28 18:02:09,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:09,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:09,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:09,484 INFO L175 Difference]: Start difference. First operand has 164 places, 203 transitions, 1019 flow. Second operand 3 states and 876 transitions.
[2023-08-28 18:02:09,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 235 transitions, 1452 flow
[2023-08-28 18:02:09,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 235 transitions, 1447 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:02:09,496 INFO L231 Difference]: Finished difference. Result has 166 places, 206 transitions, 1046 flow
[2023-08-28 18:02:09,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=166, PETRI_TRANSITIONS=206}
[2023-08-28 18:02:09,496 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places.
[2023-08-28 18:02:09,496 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 206 transitions, 1046 flow
[2023-08-28 18:02:09,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:09,497 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:09,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:09,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-08-28 18:02:09,497 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:09,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1785079808, now seen corresponding path program 1 times
[2023-08-28 18:02:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284803407]
[2023-08-28 18:02:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:09,817 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-28 18:02:09,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:09,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284803407]
[2023-08-28 18:02:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284803407] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:09,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:09,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-28 18:02:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900192200]
[2023-08-28 18:02:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-28 18:02:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-28 18:02:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-08-28 18:02:09,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 516
[2023-08-28 18:02:09,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 206 transitions, 1046 flow. Second operand has 6 states, 6 states have (on average 252.83333333333334) internal successors, (1517), 6 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:09,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:09,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 516
[2023-08-28 18:02:09,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:11,288 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L726-3-->L726-5: Formula: (= |v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15| |v_#race~next_alloc_idx~0_173|) InVars {} OutVars{#race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_173|, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1=|v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15|} AuxVars[] AssignedVars[#race~next_alloc_idx~0, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1][76], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 105#L726-5true, 305#L720-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 394#(= ~state~0 0), Black: 392#true, Black: 338#(= |#race~next_alloc_idx~0| 0), Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), 864#true, Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, 135#L789-5true, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:11,288 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-08-28 18:02:11,288 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event
[2023-08-28 18:02:11,289 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event
[2023-08-28 18:02:11,289 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event
[2023-08-28 18:02:11,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L726-3-->L726-5: Formula: (= |v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15| |v_#race~next_alloc_idx~0_173|) InVars {} OutVars{#race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_173|, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1=|v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15|} AuxVars[] AssignedVars[#race~next_alloc_idx~0, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1][76], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 105#L726-5true, 305#L720-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 394#(= ~state~0 0), Black: 392#true, Black: 338#(= |#race~next_alloc_idx~0| 0), 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), 864#true, Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:11,481 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-08-28 18:02:11,481 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event
[2023-08-28 18:02:11,481 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event
[2023-08-28 18:02:11,481 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:12,404 INFO L130 PetriNetUnfolder]: 9777/20185 cut-off events.
[2023-08-28 18:02:12,404 INFO L131 PetriNetUnfolder]: For 37775/38579 co-relation queries the response was YES.
[2023-08-28 18:02:12,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58314 conditions, 20185 events. 9777/20185 cut-off events. For 37775/38579 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 187806 event pairs, 2719 based on Foata normal form. 274/19188 useless extension candidates. Maximal degree in co-relation 58294. Up to 8933 conditions per place.
[2023-08-28 18:02:12,577 INFO L137 encePairwiseOnDemand]: 490/516 looper letters, 293 selfloop transitions, 96 changer transitions 0/481 dead transitions.
[2023-08-28 18:02:12,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 481 transitions, 3192 flow
[2023-08-28 18:02:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-28 18:02:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-28 18:02:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1799 transitions.
[2023-08-28 18:02:12,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5810723514211886
[2023-08-28 18:02:12,580 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1799 transitions.
[2023-08-28 18:02:12,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1799 transitions.
[2023-08-28 18:02:12,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:12,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1799 transitions.
[2023-08-28 18:02:12,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 299.8333333333333) internal successors, (1799), 6 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:12,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:12,586 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:12,586 INFO L175 Difference]: Start difference. First operand has 166 places, 206 transitions, 1046 flow. Second operand 6 states and 1799 transitions.
[2023-08-28 18:02:12,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 481 transitions, 3192 flow
[2023-08-28 18:02:12,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 481 transitions, 3183 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-28 18:02:12,609 INFO L231 Difference]: Finished difference. Result has 175 places, 302 transitions, 2311 flow
[2023-08-28 18:02:12,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2311, PETRI_PLACES=175, PETRI_TRANSITIONS=302}
[2023-08-28 18:02:12,609 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 5 predicate places.
[2023-08-28 18:02:12,609 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 302 transitions, 2311 flow
[2023-08-28 18:02:12,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.83333333333334) internal successors, (1517), 6 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:12,610 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:12,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:12,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-08-28 18:02:12,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err19ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:12,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -965719438, now seen corresponding path program 1 times
[2023-08-28 18:02:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920211663]
[2023-08-28 18:02:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:12,678 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-28 18:02:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920211663]
[2023-08-28 18:02:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920211663] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:12,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:12,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:02:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711962978]
[2023-08-28 18:02:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:12,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:02:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:02:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:02:12,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 516
[2023-08-28 18:02:12,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 302 transitions, 2311 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:12,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:12,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 516
[2023-08-28 18:02:12,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:13,878 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L726-3-->L726-5: Formula: (= |v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15| |v_#race~next_alloc_idx~0_173|) InVars {} OutVars{#race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_173|, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1=|v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15|} AuxVars[] AssignedVars[#race~next_alloc_idx~0, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1][76], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 105#L726-5true, 305#L720-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 394#(= ~state~0 0), Black: 392#true, Black: 338#(= |#race~next_alloc_idx~0| 0), Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, 135#L789-5true, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:13,878 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-08-28 18:02:13,878 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event
[2023-08-28 18:02:13,878 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event
[2023-08-28 18:02:13,878 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event
[2023-08-28 18:02:14,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L726-3-->L726-5: Formula: (= |v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15| |v_#race~next_alloc_idx~0_173|) InVars {} OutVars{#race~next_alloc_idx~0=|v_#race~next_alloc_idx~0_173|, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1=|v_thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1_15|} AuxVars[] AssignedVars[#race~next_alloc_idx~0, thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1][76], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 105#L726-5true, 305#L720-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 394#(= ~state~0 0), Black: 392#true, Black: 338#(= |#race~next_alloc_idx~0| 0), 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:14,094 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-08-28 18:02:14,094 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event
[2023-08-28 18:02:14,094 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:14,094 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event
[2023-08-28 18:02:15,060 INFO L130 PetriNetUnfolder]: 8503/18886 cut-off events.
[2023-08-28 18:02:15,060 INFO L131 PetriNetUnfolder]: For 55440/56374 co-relation queries the response was YES.
[2023-08-28 18:02:15,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61699 conditions, 18886 events. 8503/18886 cut-off events. For 55440/56374 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 180810 event pairs, 4662 based on Foata normal form. 234/17928 useless extension candidates. Maximal degree in co-relation 61675. Up to 12742 conditions per place.
[2023-08-28 18:02:15,241 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 221 selfloop transitions, 5 changer transitions 0/339 dead transitions.
[2023-08-28 18:02:15,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 339 transitions, 3028 flow
[2023-08-28 18:02:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions.
[2023-08-28 18:02:15,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652454780361758
[2023-08-28 18:02:15,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 875 transitions.
[2023-08-28 18:02:15,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 875 transitions.
[2023-08-28 18:02:15,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:15,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 875 transitions.
[2023-08-28 18:02:15,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.6666666666667) internal successors, (875), 3 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:15,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:15,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:15,247 INFO L175 Difference]: Start difference. First operand has 175 places, 302 transitions, 2311 flow. Second operand 3 states and 875 transitions.
[2023-08-28 18:02:15,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 339 transitions, 3028 flow
[2023-08-28 18:02:15,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 339 transitions, 3028 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-28 18:02:15,282 INFO L231 Difference]: Finished difference. Result has 178 places, 305 transitions, 2346 flow
[2023-08-28 18:02:15,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2311, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2346, PETRI_PLACES=178, PETRI_TRANSITIONS=305}
[2023-08-28 18:02:15,282 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 8 predicate places.
[2023-08-28 18:02:15,283 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 305 transitions, 2346 flow
[2023-08-28 18:02:15,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:15,283 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:15,283 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:15,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-08-28 18:02:15,283 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:15,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash -370733924, now seen corresponding path program 1 times
[2023-08-28 18:02:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524830720]
[2023-08-28 18:02:15,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524830720]
[2023-08-28 18:02:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524830720] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:15,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-28 18:02:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864343773]
[2023-08-28 18:02:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:15,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-28 18:02:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:15,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-28 18:02:15,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2023-08-28 18:02:15,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 516
[2023-08-28 18:02:15,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 305 transitions, 2346 flow. Second operand has 7 states, 7 states have (on average 265.14285714285717) internal successors, (1856), 7 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:15,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:15,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 516
[2023-08-28 18:02:15,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:17,338 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 234#L742-2true, Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,338 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-08-28 18:02:17,338 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event
[2023-08-28 18:02:17,338 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event
[2023-08-28 18:02:17,338 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event
[2023-08-28 18:02:17,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 80#L746-2true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,422 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-08-28 18:02:17,422 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event
[2023-08-28 18:02:17,422 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event
[2023-08-28 18:02:17,422 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event
[2023-08-28 18:02:17,423 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 77#L765-5true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,423 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-08-28 18:02:17,423 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event
[2023-08-28 18:02:17,423 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event
[2023-08-28 18:02:17,423 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event
[2023-08-28 18:02:17,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), 48#L766-2true, Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,509 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-08-28 18:02:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event
[2023-08-28 18:02:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event
[2023-08-28 18:02:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event
[2023-08-28 18:02:17,601 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 88#L741-3true, Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,601 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-08-28 18:02:17,601 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:17,601 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:17,601 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:17,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 191#L747-2true, Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,603 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-08-28 18:02:17,603 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:17,604 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:17,604 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event
[2023-08-28 18:02:17,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 81#L720true, 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,699 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2023-08-28 18:02:17,699 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event
[2023-08-28 18:02:17,699 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event
[2023-08-28 18:02:17,699 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event
[2023-08-28 18:02:17,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 34#L748-1true, 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,701 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2023-08-28 18:02:17,701 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event
[2023-08-28 18:02:17,701 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event
[2023-08-28 18:02:17,701 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event
[2023-08-28 18:02:17,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][280], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 114#L748-2true, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,801 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-08-28 18:02:17,801 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event
[2023-08-28 18:02:17,801 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event
[2023-08-28 18:02:17,801 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event
[2023-08-28 18:02:17,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][291], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), 228#L748-3true, Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:17,897 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-08-28 18:02:17,897 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event
[2023-08-28 18:02:17,898 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event
[2023-08-28 18:02:17,898 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event
[2023-08-28 18:02:17,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][315], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 129#L748-4true])
[2023-08-28 18:02:17,965 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-08-28 18:02:17,965 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event
[2023-08-28 18:02:17,965 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event
[2023-08-28 18:02:17,965 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event
[2023-08-28 18:02:18,023 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), 256#L748-5true, Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:18,024 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-08-28 18:02:18,024 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event
[2023-08-28 18:02:18,024 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event
[2023-08-28 18:02:18,024 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event
[2023-08-28 18:02:18,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 110#L749true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:18,076 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-08-28 18:02:18,076 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event
[2023-08-28 18:02:18,076 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event
[2023-08-28 18:02:18,076 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event
[2023-08-28 18:02:18,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 115#L749-2true, 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 881#true, Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:18,125 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-08-28 18:02:18,125 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event
[2023-08-28 18:02:18,125 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event
[2023-08-28 18:02:18,125 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event
[2023-08-28 18:02:18,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][230], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), 264#L750true, Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:18,206 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2023-08-28 18:02:18,206 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2023-08-28 18:02:18,206 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2023-08-28 18:02:18,206 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2023-08-28 18:02:18,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 283#L750-2true, Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:18,240 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event
[2023-08-28 18:02:18,240 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2023-08-28 18:02:18,240 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2023-08-28 18:02:18,240 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2023-08-28 18:02:18,358 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][182], [395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 881#true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 163#L752true])
[2023-08-28 18:02:18,358 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event
[2023-08-28 18:02:18,358 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event
[2023-08-28 18:02:18,358 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event
[2023-08-28 18:02:18,358 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event
[2023-08-28 18:02:18,414 INFO L130 PetriNetUnfolder]: 8601/20217 cut-off events.
[2023-08-28 18:02:18,414 INFO L131 PetriNetUnfolder]: For 61271/62788 co-relation queries the response was YES.
[2023-08-28 18:02:18,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67199 conditions, 20217 events. 8601/20217 cut-off events. For 61271/62788 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 202712 event pairs, 2255 based on Foata normal form. 402/19497 useless extension candidates. Maximal degree in co-relation 67173. Up to 11872 conditions per place.
[2023-08-28 18:02:18,630 INFO L137 encePairwiseOnDemand]: 504/516 looper letters, 230 selfloop transitions, 49 changer transitions 0/398 dead transitions.
[2023-08-28 18:02:18,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 398 transitions, 3683 flow
[2023-08-28 18:02:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-28 18:02:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-28 18:02:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1686 transitions.
[2023-08-28 18:02:18,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445736434108527
[2023-08-28 18:02:18,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1686 transitions.
[2023-08-28 18:02:18,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1686 transitions.
[2023-08-28 18:02:18,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:18,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1686 transitions.
[2023-08-28 18:02:18,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:18,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:18,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:18,638 INFO L175 Difference]: Start difference. First operand has 178 places, 305 transitions, 2346 flow. Second operand 6 states and 1686 transitions.
[2023-08-28 18:02:18,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 398 transitions, 3683 flow
[2023-08-28 18:02:18,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 398 transitions, 3673 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-08-28 18:02:18,681 INFO L231 Difference]: Finished difference. Result has 184 places, 341 transitions, 3020 flow
[2023-08-28 18:02:18,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3020, PETRI_PLACES=184, PETRI_TRANSITIONS=341}
[2023-08-28 18:02:18,682 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places.
[2023-08-28 18:02:18,682 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 341 transitions, 3020 flow
[2023-08-28 18:02:18,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 265.14285714285717) internal successors, (1856), 7 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:18,682 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:18,682 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:18,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-08-28 18:02:18,682 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:18,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1136692550, now seen corresponding path program 1 times
[2023-08-28 18:02:18,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507584175]
[2023-08-28 18:02:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:02:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507584175]
[2023-08-28 18:02:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507584175] provided 0 perfect and 1 imperfect interpolant sequences
[2023-08-28 18:02:19,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979563314]
[2023-08-28 18:02:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:19,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-08-28 18:02:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-28 18:02:19,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-08-28 18:02:19,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-08-28 18:02:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:19,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 48 conjunts are in the unsatisfiable core
[2023-08-28 18:02:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-28 18:02:19,703 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-08-28 18:02:19,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-08-28 18:02:19,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-08-28 18:02:19,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:02:20,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:02:20,053 INFO L190 IndexEqualityManager]: detected not equals via solver
[2023-08-28 18:02:20,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-08-28 18:02:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:02:20,081 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2023-08-28 18:02:20,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-08-28 18:02:20,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26
[2023-08-28 18:02:20,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 247
[2023-08-28 18:02:20,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102
[2023-08-28 18:02:20,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 100
[2023-08-28 18:02:20,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92
[2023-08-28 18:02:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-28 18:02:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979563314] provided 0 perfect and 2 imperfect interpolant sequences
[2023-08-28 18:02:20,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-08-28 18:02:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 6] total 17
[2023-08-28 18:02:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599805334]
[2023-08-28 18:02:20,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-08-28 18:02:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-08-28 18:02:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-08-28 18:02:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=240, Unknown=4, NotChecked=0, Total=306
[2023-08-28 18:02:20,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 516
[2023-08-28 18:02:20,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 341 transitions, 3020 flow. Second operand has 18 states, 18 states have (on average 247.83333333333334) internal successors, (4461), 18 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:20,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:20,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 516
[2023-08-28 18:02:20,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:25,150 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 234#L742-2true, 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,150 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event
[2023-08-28 18:02:25,150 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event
[2023-08-28 18:02:25,150 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event
[2023-08-28 18:02:25,150 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event
[2023-08-28 18:02:25,182 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 80#L746-2true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,182 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-08-28 18:02:25,182 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-08-28 18:02:25,183 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-08-28 18:02:25,183 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-08-28 18:02:25,183 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 77#L765-5true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,183 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-08-28 18:02:25,183 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event
[2023-08-28 18:02:25,183 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event
[2023-08-28 18:02:25,183 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-08-28 18:02:25,254 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), 48#L766-2true, Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,255 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event
[2023-08-28 18:02:25,255 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event
[2023-08-28 18:02:25,255 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2023-08-28 18:02:25,255 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event
[2023-08-28 18:02:25,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 88#L741-3true, Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,319 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-08-28 18:02:25,319 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-08-28 18:02:25,319 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event
[2023-08-28 18:02:25,319 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-08-28 18:02:25,320 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 191#L747-2true, 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,320 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event
[2023-08-28 18:02:25,320 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event
[2023-08-28 18:02:25,320 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event
[2023-08-28 18:02:25,320 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event
[2023-08-28 18:02:25,391 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 81#L720true, 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,392 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-08-28 18:02:25,392 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-08-28 18:02:25,392 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-08-28 18:02:25,392 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2023-08-28 18:02:25,393 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 34#L748-1true, 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,393 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event
[2023-08-28 18:02:25,393 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event
[2023-08-28 18:02:25,394 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-08-28 18:02:25,394 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event
[2023-08-28 18:02:25,444 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][228], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), 301#L720-2true, thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,445 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,445 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event
[2023-08-28 18:02:25,445 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event
[2023-08-28 18:02:25,445 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,449 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][445], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 114#L748-2true, 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,449 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,449 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,449 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event
[2023-08-28 18:02:25,449 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2023-08-28 18:02:25,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1950] L726-2-->L726-4: Formula: (= v_~next_alloc_idx~0_121 (+ 2 v_~next_alloc_idx~0_122)) InVars {~next_alloc_idx~0=v_~next_alloc_idx~0_122} OutVars{thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1=|v_thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1_23|, ~next_alloc_idx~0=v_~next_alloc_idx~0_121} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1, ~next_alloc_idx~0][369], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 234#L742-2true, 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 227#L726-4true, 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,495 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,495 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,495 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event
[2023-08-28 18:02:25,495 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,496 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][456], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), 228#L748-3true, Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,496 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event
[2023-08-28 18:02:25,496 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event
[2023-08-28 18:02:25,496 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event
[2023-08-28 18:02:25,496 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-08-28 18:02:25,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1950] L726-2-->L726-4: Formula: (= v_~next_alloc_idx~0_121 (+ 2 v_~next_alloc_idx~0_122)) InVars {~next_alloc_idx~0=v_~next_alloc_idx~0_122} OutVars{thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1=|v_thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1_23|, ~next_alloc_idx~0=v_~next_alloc_idx~0_121} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1, ~next_alloc_idx~0][369], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 80#L746-2true, 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 227#L726-4true, 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,536 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event
[2023-08-28 18:02:25,537 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event
[2023-08-28 18:02:25,537 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event
[2023-08-28 18:02:25,537 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event
[2023-08-28 18:02:25,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][461], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 129#L748-4true])
[2023-08-28 18:02:25,539 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event
[2023-08-28 18:02:25,539 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2023-08-28 18:02:25,539 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event
[2023-08-28 18:02:25,540 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2023-08-28 18:02:25,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), 256#L748-5true, Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,577 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event
[2023-08-28 18:02:25,577 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event
[2023-08-28 18:02:25,577 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event
[2023-08-28 18:02:25,578 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2023-08-28 18:02:25,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 110#L749true, 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,611 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event
[2023-08-28 18:02:25,611 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event
[2023-08-28 18:02:25,611 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event
[2023-08-28 18:02:25,611 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event
[2023-08-28 18:02:25,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 115#L749-2true, 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,644 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event
[2023-08-28 18:02:25,644 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event
[2023-08-28 18:02:25,644 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event
[2023-08-28 18:02:25,644 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event
[2023-08-28 18:02:25,708 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][446], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, 869#true, 851#(= ~state~0 1), Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), 214#L742-2true, Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), 264#L750true, Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,709 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event
[2023-08-28 18:02:25,709 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event
[2023-08-28 18:02:25,709 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2023-08-28 18:02:25,709 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event
[2023-08-28 18:02:25,751 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), 283#L750-2true, Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse])
[2023-08-28 18:02:25,751 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2023-08-28 18:02:25,751 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2023-08-28 18:02:25,751 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2023-08-28 18:02:25,751 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2023-08-28 18:02:25,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), 214#L742-2true, Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 238#L751true])
[2023-08-28 18:02:25,781 INFO L383 tUnfolder$Statistics]: this new event has 103 ancestors and is cut-off event
[2023-08-28 18:02:25,781 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event
[2023-08-28 18:02:25,781 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event
[2023-08-28 18:02:25,781 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event
[2023-08-28 18:02:25,879 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2044] L722-->L742-2: Formula: (let ((.cse4 (select |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|))) (and (not (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) (= 0 |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_~#m~0.base_188| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21| |v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|) (= |v_#race_1661| (store |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (let ((.cse1 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 2))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 3)) (.cse3 (select (select |v_#race_1661| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) .cse1))) (store (store (let ((.cse0 (+ |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 1))) (store (store (store (store (store (store (select |v_#race_1662| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0) .cse0 0) .cse1 0) .cse2 0) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| .cse3) .cse0 .cse3)) .cse1 .cse3) .cse2 .cse3))))) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| |v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|) (= |v_thr1Thread2of2ForFork0_push_#t~ret14#1_33| |v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|) (= |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43| |v_~#m~0.offset_188|) (= |v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45| (ite (= (select .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|) 1) 1 0)) (= (store |v_#memory_int_999| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43| (store .cse4 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43| 0)) |v_#memory_int_998|))) InVars {#race=|v_#race_1662|, ~#m~0.base=|v_~#m~0.base_188|, ~#m~0.offset=|v_~#m~0.offset_188|, #memory_int=|v_#memory_int_999|} OutVars{#race=|v_#race_1661|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_45|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base_43|, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1=|v_thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1_27|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset_43|, ~#m~0.base=|v_~#m~0.base_188|, thr1Thread2of2ForFork0_index_malloc_#res#1=|v_thr1Thread2of2ForFork0_index_malloc_#res#1_21|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1_43|, ~#m~0.offset=|v_~#m~0.offset_188|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset_43|, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1_43|, #memory_int=|v_#memory_int_998|, thr1Thread2of2ForFork0_push_#t~ret14#1=|v_thr1Thread2of2ForFork0_push_#t~ret14#1_33|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of2ForFork0_index_malloc_~curr_alloc_idx~0#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of2ForFork0_index_malloc_#res#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread2of2ForFork0___VERIFIER_atomic_release_#t~mem5#1, #memory_int, thr1Thread2of2ForFork0_push_#t~ret14#1, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1][368], [Black: 890#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (not (= |~#m~0.base| |~#m2~0.base|))), 395#|thr1Thread1of2ForFork0_#t~switch23#1|, Black: 894#(and (= ~state~0 (select (select |#memory_int| |~#m~0.base|) |~#m~0.offset|)) (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), 851#(= ~state~0 1), 869#true, Black: 715#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 841#(= ~next_alloc_idx~0 1), Black: 397#(and |thr1Thread1of2ForFork0_#t~switch23#1| (= ~state~0 0)), 214#L742-2true, Black: 846#(= |#race~next_alloc_idx~0| |thr1Thread1of2ForFork0_index_malloc_#t~nondet11#1|), Black: 394#(= ~state~0 0), Black: 392#true, Black: 336#true, 242#L789-4true, Black: 855#(= |thr1Thread2of2ForFork0_index_malloc_#t~nondet11#1| |#race~next_alloc_idx~0|), Black: 410#(= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1), Black: 861#(= |thr1Thread1of2ForFork0_push_#t~nondet15#1| (select |#race~memory~0| |thr1Thread1of2ForFork0_push_~newTop~0#1|)), Black: 866#(= (select |#race~memory~0| |thr1Thread2of2ForFork0_push_~newTop~0#1|) |thr1Thread2of2ForFork0_push_#t~nondet15#1|), 316#true, 555#(not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)), Black: 440#(and (<= |~#top~0.base| 4) (= (select (select |#memory_int| 5) 0) 1) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|)), 1195#(and (= ~state~0 1) (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#m~0.offset| 0) (= 3 |~#m~0.base|) (= 5 |~#m2~0.base|)), Black: 872#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0)), Black: 874#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 3 |~#top~0.offset|)) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 873#(and (= (select (select |#race| |~#top~0.base|) (+ |~#top~0.offset| 1)) 0) (= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0) (= (select (select |#race| |~#top~0.base|) (+ 2 |~#top~0.offset|)) 0)), Black: 871#(= (select (select |#race| |~#top~0.base|) |~#top~0.offset|) 0), 889#(and (= ~state~0 1) (not (= |~#m~0.base| |~#m2~0.base|))), Black: 883#(= (select |#race~memory~0| (+ |thr1Thread1of2ForFork0_push_~newTop~0#1| 1)) |thr1Thread1of2ForFork0_push_#t~nondet17#1|), 705#(and (<= |~#top~0.base| 4) (= |~#m2~0.offset| 0) (= 5 |~#m2~0.base|) (not (= 5 |ULTIMATE.start_main_~#t~0#1.base|))), Black: 556#(and (not (= |ULTIMATE.start_main_~#t~0#1.base| |~#m2~0.base|)) (= (select (select |#memory_int| |~#m2~0.base|) |~#m2~0.offset|) 1)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 163#L752true])
[2023-08-28 18:02:25,880 INFO L383 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event
[2023-08-28 18:02:25,880 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event
[2023-08-28 18:02:25,880 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event
[2023-08-28 18:02:25,880 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event
[2023-08-28 18:02:25,963 INFO L130 PetriNetUnfolder]: 13761/31467 cut-off events.
[2023-08-28 18:02:25,964 INFO L131 PetriNetUnfolder]: For 129835/133608 co-relation queries the response was YES.
[2023-08-28 18:02:26,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114534 conditions, 31467 events. 13761/31467 cut-off events. For 129835/133608 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 310221 event pairs, 2501 based on Foata normal form. 904/30640 useless extension candidates. Maximal degree in co-relation 114506. Up to 13125 conditions per place.
[2023-08-28 18:02:26,416 INFO L137 encePairwiseOnDemand]: 497/516 looper letters, 281 selfloop transitions, 207 changer transitions 1/603 dead transitions.
[2023-08-28 18:02:26,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 603 transitions, 6330 flow
[2023-08-28 18:02:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2023-08-28 18:02:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-08-28 18:02:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2649 transitions.
[2023-08-28 18:02:26,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133720930232558
[2023-08-28 18:02:26,421 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2649 transitions.
[2023-08-28 18:02:26,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2649 transitions.
[2023-08-28 18:02:26,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:26,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2649 transitions.
[2023-08-28 18:02:26,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 264.9) internal successors, (2649), 10 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:26,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 516.0) internal successors, (5676), 11 states have internal predecessors, (5676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:26,429 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 516.0) internal successors, (5676), 11 states have internal predecessors, (5676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:26,429 INFO L175 Difference]: Start difference. First operand has 184 places, 341 transitions, 3020 flow. Second operand 10 states and 2649 transitions.
[2023-08-28 18:02:26,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 603 transitions, 6330 flow
[2023-08-28 18:02:26,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 603 transitions, 6322 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-08-28 18:02:26,496 INFO L231 Difference]: Finished difference. Result has 194 places, 451 transitions, 5451 flow
[2023-08-28 18:02:26,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5451, PETRI_PLACES=194, PETRI_TRANSITIONS=451}
[2023-08-28 18:02:26,497 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 24 predicate places.
[2023-08-28 18:02:26,497 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 451 transitions, 5451 flow
[2023-08-28 18:02:26,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 247.83333333333334) internal successors, (4461), 18 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:26,498 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:26,499 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:26,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-08-28 18:02:26,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2023-08-28 18:02:26,705 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:26,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1570855282, now seen corresponding path program 1 times
[2023-08-28 18:02:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055540333]
[2023-08-28 18:02:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:27,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:27,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055540333]
[2023-08-28 18:02:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055540333] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:27,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:27,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-28 18:02:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489875467]
[2023-08-28 18:02:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:27,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-28 18:02:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-28 18:02:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-08-28 18:02:27,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 516
[2023-08-28 18:02:27,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 451 transitions, 5451 flow. Second operand has 8 states, 8 states have (on average 251.875) internal successors, (2015), 8 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:27,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:27,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 516
[2023-08-28 18:02:27,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:32,898 INFO L130 PetriNetUnfolder]: 15677/31609 cut-off events.
[2023-08-28 18:02:32,898 INFO L131 PetriNetUnfolder]: For 171549/175074 co-relation queries the response was YES.
[2023-08-28 18:02:33,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126630 conditions, 31609 events. 15677/31609 cut-off events. For 171549/175074 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 290363 event pairs, 2370 based on Foata normal form. 791/30493 useless extension candidates. Maximal degree in co-relation 126599. Up to 12034 conditions per place.
[2023-08-28 18:02:33,305 INFO L137 encePairwiseOnDemand]: 493/516 looper letters, 407 selfloop transitions, 175 changer transitions 0/674 dead transitions.
[2023-08-28 18:02:33,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 674 transitions, 7797 flow
[2023-08-28 18:02:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-28 18:02:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-28 18:02:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2047 transitions.
[2023-08-28 18:02:33,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5667220376522702
[2023-08-28 18:02:33,307 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2047 transitions.
[2023-08-28 18:02:33,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2047 transitions.
[2023-08-28 18:02:33,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:33,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2047 transitions.
[2023-08-28 18:02:33,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 292.42857142857144) internal successors, (2047), 7 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:33,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:33,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:33,312 INFO L175 Difference]: Start difference. First operand has 194 places, 451 transitions, 5451 flow. Second operand 7 states and 2047 transitions.
[2023-08-28 18:02:33,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 674 transitions, 7797 flow
[2023-08-28 18:02:33,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 674 transitions, 7429 flow, removed 126 selfloop flow, removed 7 redundant places.
[2023-08-28 18:02:33,429 INFO L231 Difference]: Finished difference. Result has 198 places, 471 transitions, 6004 flow
[2023-08-28 18:02:33,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=5113, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6004, PETRI_PLACES=198, PETRI_TRANSITIONS=471}
[2023-08-28 18:02:33,430 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 28 predicate places.
[2023-08-28 18:02:33,430 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 471 transitions, 6004 flow
[2023-08-28 18:02:33,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 251.875) internal successors, (2015), 8 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:33,431 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:33,431 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:33,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-08-28 18:02:33,432 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err19ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:33,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1531242831, now seen corresponding path program 1 times
[2023-08-28 18:02:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525269635]
[2023-08-28 18:02:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:33,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525269635]
[2023-08-28 18:02:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525269635] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-28 18:02:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580716614]
[2023-08-28 18:02:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:33,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-28 18:02:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-28 18:02:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-28 18:02:33,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 516
[2023-08-28 18:02:33,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 471 transitions, 6004 flow. Second operand has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:33,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:33,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 516
[2023-08-28 18:02:33,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:39,072 INFO L130 PetriNetUnfolder]: 13347/29014 cut-off events.
[2023-08-28 18:02:39,072 INFO L131 PetriNetUnfolder]: For 194426/197878 co-relation queries the response was YES.
[2023-08-28 18:02:39,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123575 conditions, 29014 events. 13347/29014 cut-off events. For 194426/197878 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 275431 event pairs, 4128 based on Foata normal form. 507/27504 useless extension candidates. Maximal degree in co-relation 123540. Up to 20407 conditions per place.
[2023-08-28 18:02:39,324 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 402 selfloop transitions, 6 changer transitions 0/527 dead transitions.
[2023-08-28 18:02:39,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 527 transitions, 7504 flow
[2023-08-28 18:02:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-28 18:02:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-28 18:02:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions.
[2023-08-28 18:02:39,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652454780361758
[2023-08-28 18:02:39,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 875 transitions.
[2023-08-28 18:02:39,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 875 transitions.
[2023-08-28 18:02:39,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:39,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 875 transitions.
[2023-08-28 18:02:39,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.6666666666667) internal successors, (875), 3 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:39,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:39,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:39,328 INFO L175 Difference]: Start difference. First operand has 198 places, 471 transitions, 6004 flow. Second operand 3 states and 875 transitions.
[2023-08-28 18:02:39,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 527 transitions, 7504 flow
[2023-08-28 18:02:39,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 527 transitions, 7487 flow, removed 8 selfloop flow, removed 1 redundant places.
[2023-08-28 18:02:39,460 INFO L231 Difference]: Finished difference. Result has 200 places, 474 transitions, 6027 flow
[2023-08-28 18:02:39,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=5987, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6027, PETRI_PLACES=200, PETRI_TRANSITIONS=474}
[2023-08-28 18:02:39,461 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 30 predicate places.
[2023-08-28 18:02:39,461 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 474 transitions, 6027 flow
[2023-08-28 18:02:39,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:39,461 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:39,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:39,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2023-08-28 18:02:39,462 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err24ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:39,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:39,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1921154661, now seen corresponding path program 1 times
[2023-08-28 18:02:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782239078]
[2023-08-28 18:02:39,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:39,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:40,569 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-28 18:02:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782239078]
[2023-08-28 18:02:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782239078] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-28 18:02:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336676190]
[2023-08-28 18:02:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:40,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-28 18:02:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:40,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-28 18:02:40,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-08-28 18:02:40,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 516
[2023-08-28 18:02:40,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 474 transitions, 6027 flow. Second operand has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:40,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:40,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 516
[2023-08-28 18:02:40,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:47,370 INFO L130 PetriNetUnfolder]: 17756/37656 cut-off events.
[2023-08-28 18:02:47,370 INFO L131 PetriNetUnfolder]: For 262439/266910 co-relation queries the response was YES.
[2023-08-28 18:02:47,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162873 conditions, 37656 events. 17756/37656 cut-off events. For 262439/266910 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 366835 event pairs, 3852 based on Foata normal form. 1025/36301 useless extension candidates. Maximal degree in co-relation 162837. Up to 21963 conditions per place.
[2023-08-28 18:02:47,704 INFO L137 encePairwiseOnDemand]: 501/516 looper letters, 468 selfloop transitions, 172 changer transitions 0/754 dead transitions.
[2023-08-28 18:02:47,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 754 transitions, 10892 flow
[2023-08-28 18:02:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-28 18:02:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-28 18:02:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1697 transitions.
[2023-08-28 18:02:47,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481266149870802
[2023-08-28 18:02:47,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1697 transitions.
[2023-08-28 18:02:47,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1697 transitions.
[2023-08-28 18:02:47,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:47,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1697 transitions.
[2023-08-28 18:02:47,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 282.8333333333333) internal successors, (1697), 6 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:47,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:47,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:47,709 INFO L175 Difference]: Start difference. First operand has 200 places, 474 transitions, 6027 flow. Second operand 6 states and 1697 transitions.
[2023-08-28 18:02:47,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 754 transitions, 10892 flow
[2023-08-28 18:02:47,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 754 transitions, 10873 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-08-28 18:02:47,967 INFO L231 Difference]: Finished difference. Result has 209 places, 645 transitions, 9971 flow
[2023-08-28 18:02:47,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=6017, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9971, PETRI_PLACES=209, PETRI_TRANSITIONS=645}
[2023-08-28 18:02:47,967 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, 39 predicate places.
[2023-08-28 18:02:47,967 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 645 transitions, 9971 flow
[2023-08-28 18:02:47,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:47,968 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-28 18:02:47,968 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-28 18:02:47,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-08-28 18:02:47,968 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err17ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE (and 74 more)] ===
[2023-08-28 18:02:47,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-28 18:02:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 928808421, now seen corresponding path program 1 times
[2023-08-28 18:02:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-28 18:02:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350619937]
[2023-08-28 18:02:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-28 18:02:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-28 18:02:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-28 18:02:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-08-28 18:02:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-28 18:02:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350619937]
[2023-08-28 18:02:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350619937] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-28 18:02:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-28 18:02:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-28 18:02:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101427776]
[2023-08-28 18:02:48,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-28 18:02:48,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-28 18:02:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-28 18:02:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-28 18:02:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-08-28 18:02:48,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 516
[2023-08-28 18:02:48,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 645 transitions, 9971 flow. Second operand has 4 states, 4 states have (on average 273.25) internal successors, (1093), 4 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:48,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-28 18:02:48,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 516
[2023-08-28 18:02:48,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-28 18:02:56,929 INFO L130 PetriNetUnfolder]: 19790/44155 cut-off events.
[2023-08-28 18:02:56,929 INFO L131 PetriNetUnfolder]: For 319734/322724 co-relation queries the response was YES.
[2023-08-28 18:02:57,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194534 conditions, 44155 events. 19790/44155 cut-off events. For 319734/322724 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 458990 event pairs, 3932 based on Foata normal form. 1553/42968 useless extension candidates. Maximal degree in co-relation 194494. Up to 26688 conditions per place.
[2023-08-28 18:02:57,696 INFO L137 encePairwiseOnDemand]: 511/516 looper letters, 770 selfloop transitions, 5 changer transitions 1/901 dead transitions.
[2023-08-28 18:02:57,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 901 transitions, 15519 flow
[2023-08-28 18:02:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-28 18:02:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-28 18:02:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1195 transitions.
[2023-08-28 18:02:57,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789728682170543
[2023-08-28 18:02:57,698 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1195 transitions.
[2023-08-28 18:02:57,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1195 transitions.
[2023-08-28 18:02:57,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-28 18:02:57,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1195 transitions.
[2023-08-28 18:02:57,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 298.75) internal successors, (1195), 4 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:57,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:57,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-28 18:02:57,701 INFO L175 Difference]: Start difference. First operand has 209 places, 645 transitions, 9971 flow. Second operand 4 states and 1195 transitions.
[2023-08-28 18:02:57,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 901 transitions, 15519 flow