./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 02:40:11,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 02:40:11,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 02:40:11,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 02:40:11,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 02:40:11,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 02:40:11,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 02:40:11,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 02:40:11,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 02:40:11,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 02:40:11,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 02:40:11,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 02:40:11,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 02:40:11,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 02:40:11,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 02:40:11,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 02:40:11,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 02:40:11,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 02:40:11,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 02:40:11,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 02:40:11,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 02:40:11,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 02:40:11,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 02:40:11,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 02:40:11,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 02:40:11,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 02:40:11,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 02:40:11,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 02:40:11,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 02:40:11,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 02:40:11,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 02:40:11,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 02:40:11,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 02:40:11,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 02:40:11,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 02:40:11,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 02:40:11,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 02:40:11,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 02:40:11,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 02:40:11,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 02:40:11,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 02:40:11,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 02:40:11,346 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 02:40:11,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 02:40:11,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 02:40:11,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 02:40:11,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 02:40:11,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 02:40:11,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 02:40:11,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 02:40:11,350 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 02:40:11,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 02:40:11,351 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 02:40:11,351 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 02:40:11,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 02:40:11,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 02:40:11,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 02:40:11,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 02:40:11,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 02:40:11,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 02:40:11,352 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 02:40:11,352 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 02:40:11,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 02:40:11,353 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 02:40:11,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 02:40:11,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 02:40:11,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 02:40:11,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 02:40:11,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:40:11,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 02:40:11,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 02:40:11,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 02:40:11,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 02:40:11,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 02:40:11,355 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 02:40:11,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 02:40:11,356 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 02:40:11,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 02:40:11,356 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 02:40:11,356 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 02:40:11,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 02:40:11,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 02:40:11,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 02:40:11,711 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 02:40:11,712 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 02:40:11,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-08-29 02:40:12,948 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 02:40:13,245 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 02:40:13,253 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-08-29 02:40:13,272 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f9828e1/188095bb55b94448a5c91453df5aa803/FLAG68d3a897e [2023-08-29 02:40:13,284 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f9828e1/188095bb55b94448a5c91453df5aa803 [2023-08-29 02:40:13,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 02:40:13,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 02:40:13,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 02:40:13,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 02:40:13,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 02:40:13,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552b9a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13, skipping insertion in model container [2023-08-29 02:40:13,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 02:40:13,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 02:40:13,581 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i[30176,30189] [2023-08-29 02:40:13,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:40:13,622 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 02:40:13,672 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i[30176,30189] [2023-08-29 02:40:13,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:40:13,744 INFO L208 MainTranslator]: Completed translation [2023-08-29 02:40:13,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13 WrapperNode [2023-08-29 02:40:13,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 02:40:13,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 02:40:13,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 02:40:13,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 02:40:13,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,809 INFO L138 Inliner]: procedures = 170, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-08-29 02:40:13,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 02:40:13,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 02:40:13,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 02:40:13,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 02:40:13,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,844 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 02:40:13,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 02:40:13,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 02:40:13,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 02:40:13,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (1/1) ... [2023-08-29 02:40:13,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:40:13,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:13,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 02:40:13,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 02:40:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 02:40:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 02:40:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 02:40:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 02:40:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 02:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 02:40:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 02:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 02:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 02:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 02:40:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 02:40:13,916 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 02:40:14,019 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 02:40:14,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 02:40:14,319 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 02:40:14,326 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 02:40:14,326 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-29 02:40:14,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:40:14 BoogieIcfgContainer [2023-08-29 02:40:14,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 02:40:14,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 02:40:14,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 02:40:14,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 02:40:14,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:40:13" (1/3) ... [2023-08-29 02:40:14,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcb5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:40:14, skipping insertion in model container [2023-08-29 02:40:14,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:40:13" (2/3) ... [2023-08-29 02:40:14,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcb5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:40:14, skipping insertion in model container [2023-08-29 02:40:14,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:40:14" (3/3) ... [2023-08-29 02:40:14,335 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2023-08-29 02:40:14,340 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 02:40:14,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 02:40:14,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-29 02:40:14,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 02:40:14,415 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 02:40:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:14,507 INFO L130 PetriNetUnfolder]: 17/173 cut-off events. [2023-08-29 02:40:14,508 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:14,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 173 events. 17/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 476 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:14,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:14,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:14,529 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:14,539 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:14,542 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:14,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:14,576 INFO L130 PetriNetUnfolder]: 17/173 cut-off events. [2023-08-29 02:40:14,576 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:14,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 173 events. 17/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 476 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:14,580 INFO L119 LiptonReduction]: Number of co-enabled transitions 4136 [2023-08-29 02:40:17,385 INFO L134 LiptonReduction]: Checked pairs total: 10675 [2023-08-29 02:40:17,386 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-29 02:40:17,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:40:17,402 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:17,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 02:40:17,406 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2023-08-29 02:40:17,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:17,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:17,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:40:17,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:40:17,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 15035669, now seen corresponding path program 1 times [2023-08-29 02:40:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60657451] [2023-08-29 02:40:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60657451] [2023-08-29 02:40:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60657451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:17,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:17,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346195268] [2023-08-29 02:40:17,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:17,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:17,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 229 [2023-08-29 02:40:17,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 49 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:17,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:17,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 229 [2023-08-29 02:40:17,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:17,790 INFO L130 PetriNetUnfolder]: 120/330 cut-off events. [2023-08-29 02:40:17,791 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:17,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 330 events. 120/330 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1555 event pairs, 0 based on Foata normal form. 48/325 useless extension candidates. Maximal degree in co-relation 572. Up to 255 conditions per place. [2023-08-29 02:40:17,794 INFO L137 encePairwiseOnDemand]: 216/229 looper letters, 35 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-29 02:40:17,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 190 flow [2023-08-29 02:40:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-29 02:40:17,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5793304221251819 [2023-08-29 02:40:17,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-29 02:40:17,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-29 02:40:17,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:17,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-29 02:40:17,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:17,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:17,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:17,821 INFO L175 Difference]: Start difference. First operand has 42 places, 49 transitions, 106 flow. Second operand 3 states and 398 transitions. [2023-08-29 02:40:17,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 190 flow [2023-08-29 02:40:17,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:40:17,826 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 87 flow [2023-08-29 02:40:17,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-08-29 02:40:17,831 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 02:40:17,831 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 87 flow [2023-08-29 02:40:17,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:17,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:17,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:17,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 02:40:17,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:40:17,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash 75871057, now seen corresponding path program 1 times [2023-08-29 02:40:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:17,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162840812] [2023-08-29 02:40:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162840812] [2023-08-29 02:40:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162840812] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:40:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602452184] [2023-08-29 02:40:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:17,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:17,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:40:17,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 02:40:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:18,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:40:18,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:40:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 02:40:18,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:40:18,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602452184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:40:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-29 02:40:18,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881279530] [2023-08-29 02:40:18,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:18,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:18,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 02:40:18,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 229 [2023-08-29 02:40:18,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:18,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 229 [2023-08-29 02:40:18,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:18,271 INFO L130 PetriNetUnfolder]: 212/515 cut-off events. [2023-08-29 02:40:18,271 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 02:40:18,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 515 events. 212/515 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2377 event pairs, 74 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1028. Up to 292 conditions per place. [2023-08-29 02:40:18,274 INFO L137 encePairwiseOnDemand]: 220/229 looper letters, 40 selfloop transitions, 6 changer transitions 3/55 dead transitions. [2023-08-29 02:40:18,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 226 flow [2023-08-29 02:40:18,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-29 02:40:18,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5429403202328966 [2023-08-29 02:40:18,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-29 02:40:18,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-29 02:40:18,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:18,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-29 02:40:18,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,282 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 87 flow. Second operand 3 states and 373 transitions. [2023-08-29 02:40:18,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 226 flow [2023-08-29 02:40:18,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:18,284 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 121 flow [2023-08-29 02:40:18,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-29 02:40:18,285 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 02:40:18,285 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 121 flow [2023-08-29 02:40:18,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:18,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:18,292 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-29 02:40:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:18,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:40:18,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1622259370, now seen corresponding path program 1 times [2023-08-29 02:40:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392146648] [2023-08-29 02:40:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392146648] [2023-08-29 02:40:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392146648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491454880] [2023-08-29 02:40:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:18,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:18,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:18,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 229 [2023-08-29 02:40:18,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:18,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 229 [2023-08-29 02:40:18,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:18,653 INFO L130 PetriNetUnfolder]: 213/514 cut-off events. [2023-08-29 02:40:18,653 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-08-29 02:40:18,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 514 events. 213/514 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2371 event pairs, 154 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 1154. Up to 405 conditions per place. [2023-08-29 02:40:18,656 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 39 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-29 02:40:18,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 238 flow [2023-08-29 02:40:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-29 02:40:18,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356622998544396 [2023-08-29 02:40:18,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-29 02:40:18,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-29 02:40:18,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:18,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-29 02:40:18,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,662 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 121 flow. Second operand 3 states and 368 transitions. [2023-08-29 02:40:18,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 238 flow [2023-08-29 02:40:18,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:18,664 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 141 flow [2023-08-29 02:40:18,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-29 02:40:18,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 02:40:18,665 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 141 flow [2023-08-29 02:40:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:18,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:18,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 02:40:18,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:40:18,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1467227502, now seen corresponding path program 1 times [2023-08-29 02:40:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14941853] [2023-08-29 02:40:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14941853] [2023-08-29 02:40:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14941853] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:40:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974882712] [2023-08-29 02:40:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:18,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:18,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:40:18,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 02:40:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:18,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:40:18,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:40:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:18,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:40:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:18,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974882712] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:40:18,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:40:18,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:40:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229422066] [2023-08-29 02:40:18,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:40:18,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:40:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:18,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:40:18,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:40:18,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 229 [2023-08-29 02:40:18,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:18,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 229 [2023-08-29 02:40:18,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:18,946 INFO L130 PetriNetUnfolder]: 24/83 cut-off events. [2023-08-29 02:40:18,947 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-29 02:40:18,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 83 events. 24/83 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 148 event pairs, 11 based on Foata normal form. 13/96 useless extension candidates. Maximal degree in co-relation 180. Up to 50 conditions per place. [2023-08-29 02:40:18,947 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 21 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2023-08-29 02:40:18,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 163 flow [2023-08-29 02:40:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:40:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:40:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-29 02:40:18,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5262008733624454 [2023-08-29 02:40:18,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-29 02:40:18,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-29 02:40:18,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:18,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-29 02:40:18,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,954 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,954 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 141 flow. Second operand 4 states and 482 transitions. [2023-08-29 02:40:18,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 163 flow [2023-08-29 02:40:18,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 135 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 02:40:18,956 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 49 flow [2023-08-29 02:40:18,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=49, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-08-29 02:40:18,957 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -13 predicate places. [2023-08-29 02:40:18,957 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 49 flow [2023-08-29 02:40:18,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:18,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:18,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:18,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-29 02:40:19,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-29 02:40:19,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-08-29 02:40:19,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 16942280, now seen corresponding path program 1 times [2023-08-29 02:40:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836083646] [2023-08-29 02:40:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836083646] [2023-08-29 02:40:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836083646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108923333] [2023-08-29 02:40:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:19,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 229 [2023-08-29 02:40:19,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:19,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:19,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 229 [2023-08-29 02:40:19,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:19,266 INFO L130 PetriNetUnfolder]: 24/72 cut-off events. [2023-08-29 02:40:19,266 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 02:40:19,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 72 events. 24/72 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 22 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 143. Up to 61 conditions per place. [2023-08-29 02:40:19,266 INFO L137 encePairwiseOnDemand]: 227/229 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-08-29 02:40:19,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 89 flow [2023-08-29 02:40:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-29 02:40:19,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036390101892285 [2023-08-29 02:40:19,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-29 02:40:19,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-29 02:40:19,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:19,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-29 02:40:19,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:19,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:19,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:19,272 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 3 states and 346 transitions. [2023-08-29 02:40:19,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 89 flow [2023-08-29 02:40:19,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 85 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:19,274 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2023-08-29 02:40:19,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2023-08-29 02:40:19,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -17 predicate places. [2023-08-29 02:40:19,276 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2023-08-29 02:40:19,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:19,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2023-08-29 02:40:19,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-08-29 02:40:19,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-08-29 02:40:19,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-08-29 02:40:19,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-08-29 02:40:19,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-08-29 02:40:19,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-08-29 02:40:19,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-08-29 02:40:19,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-08-29 02:40:19,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-08-29 02:40:19,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 02:40:19,281 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-29 02:40:19,283 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:40:19,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:19,307 INFO L130 PetriNetUnfolder]: 17/173 cut-off events. [2023-08-29 02:40:19,308 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 02:40:19,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 173 events. 17/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 476 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:19,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 132 transitions, 272 flow [2023-08-29 02:40:19,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 127 transitions, 259 flow [2023-08-29 02:40:19,309 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:19,310 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 127 transitions, 259 flow [2023-08-29 02:40:19,310 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 127 transitions, 259 flow [2023-08-29 02:40:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 127 transitions, 259 flow [2023-08-29 02:40:19,323 INFO L130 PetriNetUnfolder]: 16/168 cut-off events. [2023-08-29 02:40:19,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:19,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 168 events. 16/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 476 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-08-29 02:40:19,326 INFO L119 LiptonReduction]: Number of co-enabled transitions 4136 [2023-08-29 02:40:21,955 INFO L134 LiptonReduction]: Checked pairs total: 10531 [2023-08-29 02:40:21,955 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-29 02:40:21,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:40:21,962 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:21,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:40:21,965 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2023-08-29 02:40:21,965 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:21,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:21,965 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 02:40:21,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:40:21,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 45853684, now seen corresponding path program 1 times [2023-08-29 02:40:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960213770] [2023-08-29 02:40:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:21,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:40:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:22,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:40:22,016 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:40:22,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:40:22,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 02:40:22,016 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:40:22,017 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:40:22,018 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:40:22,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 02:40:22,053 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 02:40:22,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:22,085 INFO L130 PetriNetUnfolder]: 31/290 cut-off events. [2023-08-29 02:40:22,085 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:22,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 290 events. 31/290 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 949 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 175. Up to 8 conditions per place. [2023-08-29 02:40:22,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:22,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:22,089 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:22,089 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:22,090 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:22,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:22,111 INFO L130 PetriNetUnfolder]: 31/290 cut-off events. [2023-08-29 02:40:22,111 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:22,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 290 events. 31/290 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 949 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 175. Up to 8 conditions per place. [2023-08-29 02:40:22,120 INFO L119 LiptonReduction]: Number of co-enabled transitions 13112 [2023-08-29 02:40:24,632 INFO L134 LiptonReduction]: Checked pairs total: 44237 [2023-08-29 02:40:24,632 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-29 02:40:24,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:40:24,635 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:24,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-08-29 02:40:24,636 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2023-08-29 02:40:24,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:24,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:24,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:40:24,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:24,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 28306422, now seen corresponding path program 1 times [2023-08-29 02:40:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605869212] [2023-08-29 02:40:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:24,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605869212] [2023-08-29 02:40:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605869212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407473049] [2023-08-29 02:40:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:24,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:24,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 291 [2023-08-29 02:40:24,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:24,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:24,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 291 [2023-08-29 02:40:24,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:25,171 INFO L130 PetriNetUnfolder]: 2472/5375 cut-off events. [2023-08-29 02:40:25,171 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 02:40:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9445 conditions, 5375 events. 2472/5375 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 42524 event pairs, 1140 based on Foata normal form. 788/5463 useless extension candidates. Maximal degree in co-relation 813. Up to 3973 conditions per place. [2023-08-29 02:40:25,198 INFO L137 encePairwiseOnDemand]: 272/291 looper letters, 46 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-29 02:40:25,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 274 flow [2023-08-29 02:40:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2023-08-29 02:40:25,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6036655211912944 [2023-08-29 02:40:25,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2023-08-29 02:40:25,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2023-08-29 02:40:25,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:25,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2023-08-29 02:40:25,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:25,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:25,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:25,205 INFO L175 Difference]: Start difference. First operand has 72 places, 84 transitions, 186 flow. Second operand 3 states and 527 transitions. [2023-08-29 02:40:25,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 274 flow [2023-08-29 02:40:25,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:40:25,208 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 166 flow [2023-08-29 02:40:25,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-08-29 02:40:25,210 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2023-08-29 02:40:25,210 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 166 flow [2023-08-29 02:40:25,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:25,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:25,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:25,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 02:40:25,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:25,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1872481674, now seen corresponding path program 1 times [2023-08-29 02:40:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671821199] [2023-08-29 02:40:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671821199] [2023-08-29 02:40:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671821199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:25,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:25,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415033519] [2023-08-29 02:40:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:25,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:25,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 291 [2023-08-29 02:40:25,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:25,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:25,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 291 [2023-08-29 02:40:25,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:26,573 INFO L130 PetriNetUnfolder]: 9946/17443 cut-off events. [2023-08-29 02:40:26,574 INFO L131 PetriNetUnfolder]: For 893/893 co-relation queries the response was YES. [2023-08-29 02:40:26,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34413 conditions, 17443 events. 9946/17443 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 130268 event pairs, 3677 based on Foata normal form. 0/15746 useless extension candidates. Maximal degree in co-relation 34307. Up to 8886 conditions per place. [2023-08-29 02:40:26,667 INFO L137 encePairwiseOnDemand]: 272/291 looper letters, 83 selfloop transitions, 14 changer transitions 0/114 dead transitions. [2023-08-29 02:40:26,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 114 transitions, 468 flow [2023-08-29 02:40:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2023-08-29 02:40:26,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853379152348225 [2023-08-29 02:40:26,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2023-08-29 02:40:26,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2023-08-29 02:40:26,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:26,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2023-08-29 02:40:26,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:26,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:26,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:26,676 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 166 flow. Second operand 3 states and 511 transitions. [2023-08-29 02:40:26,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 114 transitions, 468 flow [2023-08-29 02:40:26,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:26,683 INFO L231 Difference]: Finished difference. Result has 77 places, 83 transitions, 286 flow [2023-08-29 02:40:26,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=77, PETRI_TRANSITIONS=83} [2023-08-29 02:40:26,685 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2023-08-29 02:40:26,685 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 83 transitions, 286 flow [2023-08-29 02:40:26,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:26,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:26,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:26,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 02:40:26,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:26,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2078293942, now seen corresponding path program 1 times [2023-08-29 02:40:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615655715] [2023-08-29 02:40:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615655715] [2023-08-29 02:40:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615655715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:26,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:26,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:26,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149847100] [2023-08-29 02:40:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:26,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:26,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:26,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:26,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 291 [2023-08-29 02:40:26,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 83 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:26,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:26,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 291 [2023-08-29 02:40:26,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:28,056 INFO L130 PetriNetUnfolder]: 8708/15842 cut-off events. [2023-08-29 02:40:28,057 INFO L131 PetriNetUnfolder]: For 5776/5797 co-relation queries the response was YES. [2023-08-29 02:40:28,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36641 conditions, 15842 events. 8708/15842 cut-off events. For 5776/5797 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 123843 event pairs, 6327 based on Foata normal form. 0/13927 useless extension candidates. Maximal degree in co-relation 16465. Up to 13000 conditions per place. [2023-08-29 02:40:28,141 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 73 selfloop transitions, 13 changer transitions 0/117 dead transitions. [2023-08-29 02:40:28,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 117 transitions, 570 flow [2023-08-29 02:40:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2023-08-29 02:40:28,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.572737686139748 [2023-08-29 02:40:28,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2023-08-29 02:40:28,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2023-08-29 02:40:28,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:28,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2023-08-29 02:40:28,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:28,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:28,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:28,147 INFO L175 Difference]: Start difference. First operand has 77 places, 83 transitions, 286 flow. Second operand 3 states and 500 transitions. [2023-08-29 02:40:28,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 117 transitions, 570 flow [2023-08-29 02:40:28,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:28,162 INFO L231 Difference]: Finished difference. Result has 78 places, 94 transitions, 363 flow [2023-08-29 02:40:28,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=78, PETRI_TRANSITIONS=94} [2023-08-29 02:40:28,164 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 6 predicate places. [2023-08-29 02:40:28,165 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 363 flow [2023-08-29 02:40:28,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:28,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:28,165 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 02:40:28,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:28,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -234738728, now seen corresponding path program 1 times [2023-08-29 02:40:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654076300] [2023-08-29 02:40:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:40:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654076300] [2023-08-29 02:40:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654076300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:28,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:28,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:28,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964839503] [2023-08-29 02:40:28,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:28,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:28,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:28,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:28,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 291 [2023-08-29 02:40:28,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 94 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:28,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:28,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 291 [2023-08-29 02:40:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:28,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([746] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][83], [Black: 172#true, 130#L702-18true, 183#true, t_funThread1of2ForFork0InUse, 37#L702-17true, t_funThread2of2ForFork0InUse, Black: 180#(= |t_funThread1of2ForFork0_#t~nondet6| |#race~global~0|), Black: 169#(= |ULTIMATE.start_main_~i~0#1| 0), 178#true, 55#L709-4true]) [2023-08-29 02:40:28,980 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 02:40:28,980 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:40:28,980 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:40:28,980 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 02:40:29,464 INFO L130 PetriNetUnfolder]: 9191/16627 cut-off events. [2023-08-29 02:40:29,464 INFO L131 PetriNetUnfolder]: For 7843/8073 co-relation queries the response was YES. [2023-08-29 02:40:29,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39729 conditions, 16627 events. 9191/16627 cut-off events. For 7843/8073 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 130428 event pairs, 6317 based on Foata normal form. 5/14422 useless extension candidates. Maximal degree in co-relation 17527. Up to 13857 conditions per place. [2023-08-29 02:40:29,547 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 77 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2023-08-29 02:40:29,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 644 flow [2023-08-29 02:40:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-08-29 02:40:29,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.56815578465063 [2023-08-29 02:40:29,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-08-29 02:40:29,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-08-29 02:40:29,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:29,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-08-29 02:40:29,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,553 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 363 flow. Second operand 3 states and 496 transitions. [2023-08-29 02:40:29,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 644 flow [2023-08-29 02:40:29,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:29,577 INFO L231 Difference]: Finished difference. Result has 80 places, 105 transitions, 469 flow [2023-08-29 02:40:29,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=80, PETRI_TRANSITIONS=105} [2023-08-29 02:40:29,579 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-08-29 02:40:29,579 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 469 flow [2023-08-29 02:40:29,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:29,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:29,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 02:40:29,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:29,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1712626580, now seen corresponding path program 1 times [2023-08-29 02:40:29,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:29,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417337115] [2023-08-29 02:40:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417337115] [2023-08-29 02:40:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417337115] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:40:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350850359] [2023-08-29 02:40:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:29,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:29,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:40:29,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:40:29,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 02:40:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:29,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:40:29,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:40:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:29,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:40:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350850359] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:40:29,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:40:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:40:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193091692] [2023-08-29 02:40:29,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:40:29,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:40:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:40:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:40:29,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 291 [2023-08-29 02:40:29,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 105 transitions, 469 flow. Second operand has 7 states, 7 states have (on average 153.85714285714286) internal successors, (1077), 7 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:29,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 291 [2023-08-29 02:40:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:29,967 INFO L130 PetriNetUnfolder]: 1138/2460 cut-off events. [2023-08-29 02:40:29,967 INFO L131 PetriNetUnfolder]: For 2106/2193 co-relation queries the response was YES. [2023-08-29 02:40:29,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6226 conditions, 2460 events. 1138/2460 cut-off events. For 2106/2193 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 16778 event pairs, 274 based on Foata normal form. 255/2596 useless extension candidates. Maximal degree in co-relation 1871. Up to 1299 conditions per place. [2023-08-29 02:40:29,981 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 73 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-08-29 02:40:29,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 121 transitions, 664 flow [2023-08-29 02:40:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 02:40:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 02:40:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 815 transitions. [2023-08-29 02:40:29,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5601374570446735 [2023-08-29 02:40:29,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 815 transitions. [2023-08-29 02:40:29,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 815 transitions. [2023-08-29 02:40:29,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:29,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 815 transitions. [2023-08-29 02:40:29,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.0) internal successors, (815), 5 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-29 02:40:29,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,989 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,989 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 469 flow. Second operand 5 states and 815 transitions. [2023-08-29 02:40:29,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 121 transitions, 664 flow [2023-08-29 02:40:29,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 121 transitions, 646 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 02:40:29,993 INFO L231 Difference]: Finished difference. Result has 70 places, 80 transitions, 346 flow [2023-08-29 02:40:29,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2023-08-29 02:40:29,994 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2023-08-29 02:40:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 346 flow [2023-08-29 02:40:29,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 153.85714285714286) internal successors, (1077), 7 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:29,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:29,995 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-29 02:40:30,003 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-29 02:40:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:40:30,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:30,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -254035969, now seen corresponding path program 1 times [2023-08-29 02:40:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089923063] [2023-08-29 02:40:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089923063] [2023-08-29 02:40:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089923063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:30,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 02:40:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558653611] [2023-08-29 02:40:30,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:30,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 02:40:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 02:40:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 02:40:30,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 291 [2023-08-29 02:40:30,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:30,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 291 [2023-08-29 02:40:30,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:30,462 INFO L130 PetriNetUnfolder]: 111/421 cut-off events. [2023-08-29 02:40:30,462 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2023-08-29 02:40:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 421 events. 111/421 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1818 event pairs, 12 based on Foata normal form. 54/475 useless extension candidates. Maximal degree in co-relation 555. Up to 234 conditions per place. [2023-08-29 02:40:30,465 INFO L137 encePairwiseOnDemand]: 286/291 looper letters, 25 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-08-29 02:40:30,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 247 flow [2023-08-29 02:40:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:40:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:40:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2023-08-29 02:40:30,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343642611683849 [2023-08-29 02:40:30,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2023-08-29 02:40:30,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2023-08-29 02:40:30,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:30,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2023-08-29 02:40:30,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,472 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 346 flow. Second operand 4 states and 622 transitions. [2023-08-29 02:40:30,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 247 flow [2023-08-29 02:40:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 188 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-08-29 02:40:30,474 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 121 flow [2023-08-29 02:40:30,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 02:40:30,475 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2023-08-29 02:40:30,475 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 121 flow [2023-08-29 02:40:30,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:30,476 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] [2023-08-29 02:40:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 02:40:30,476 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:30,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:30,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1627502358, now seen corresponding path program 1 times [2023-08-29 02:40:30,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:30,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553727514] [2023-08-29 02:40:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:30,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:30,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:30,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553727514] [2023-08-29 02:40:30,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553727514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:30,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:30,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976653997] [2023-08-29 02:40:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:30,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:30,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 291 [2023-08-29 02:40:30,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:30,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 291 [2023-08-29 02:40:30,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:30,596 INFO L130 PetriNetUnfolder]: 134/424 cut-off events. [2023-08-29 02:40:30,596 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2023-08-29 02:40:30,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 424 events. 134/424 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1754 event pairs, 120 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 341. Up to 291 conditions per place. [2023-08-29 02:40:30,598 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 30 selfloop transitions, 2 changer transitions 3/51 dead transitions. [2023-08-29 02:40:30,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 206 flow [2023-08-29 02:40:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-29 02:40:30,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303550973654066 [2023-08-29 02:40:30,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-29 02:40:30,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-29 02:40:30,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:30,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-29 02:40:30,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,604 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 121 flow. Second operand 3 states and 463 transitions. [2023-08-29 02:40:30,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 206 flow [2023-08-29 02:40:30,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:30,605 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 111 flow [2023-08-29 02:40:30,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-29 02:40:30,606 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2023-08-29 02:40:30,606 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 111 flow [2023-08-29 02:40:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:30,607 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] [2023-08-29 02:40:30,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 02:40:30,607 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-08-29 02:40:30,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1512625829, now seen corresponding path program 1 times [2023-08-29 02:40:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:30,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011440341] [2023-08-29 02:40:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:40:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011440341] [2023-08-29 02:40:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011440341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212693109] [2023-08-29 02:40:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:30,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 291 [2023-08-29 02:40:30,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:30,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 291 [2023-08-29 02:40:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:30,709 INFO L130 PetriNetUnfolder]: 99/311 cut-off events. [2023-08-29 02:40:30,709 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-29 02:40:30,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 311 events. 99/311 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1179 event pairs, 95 based on Foata normal form. 6/313 useless extension candidates. Maximal degree in co-relation 396. Up to 230 conditions per place. [2023-08-29 02:40:30,710 INFO L137 encePairwiseOnDemand]: 289/291 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-29 02:40:30,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 175 flow [2023-08-29 02:40:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-29 02:40:30,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2023-08-29 02:40:30,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-29 02:40:30,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-29 02:40:30,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:30,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-29 02:40:30,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,716 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 111 flow. Second operand 3 states and 459 transitions. [2023-08-29 02:40:30,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 175 flow [2023-08-29 02:40:30,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:40:30,717 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2023-08-29 02:40:30,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2023-08-29 02:40:30,719 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2023-08-29 02:40:30,719 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2023-08-29 02:40:30,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:30,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2023-08-29 02:40:30,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-08-29 02:40:30,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-08-29 02:40:30,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-08-29 02:40:30,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-08-29 02:40:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 02:40:30,721 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:30,721 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:40:30,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:30,811 INFO L130 PetriNetUnfolder]: 31/290 cut-off events. [2023-08-29 02:40:30,812 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:30,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 290 events. 31/290 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 949 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 175. Up to 8 conditions per place. [2023-08-29 02:40:30,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:30,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:30,814 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:30,814 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:30,815 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:30,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 374 flow [2023-08-29 02:40:30,840 INFO L130 PetriNetUnfolder]: 31/290 cut-off events. [2023-08-29 02:40:30,840 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 02:40:30,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 290 events. 31/290 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 949 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 175. Up to 8 conditions per place. [2023-08-29 02:40:30,849 INFO L119 LiptonReduction]: Number of co-enabled transitions 13112 [2023-08-29 02:40:33,793 INFO L134 LiptonReduction]: Checked pairs total: 49546 [2023-08-29 02:40:33,793 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-29 02:40:33,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:40:33,795 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:33,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:40:33,804 INFO L130 PetriNetUnfolder]: 8/67 cut-off events. [2023-08-29 02:40:33,804 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 02:40:33,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:33,804 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 02:40:33,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:40:33,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2121467580, now seen corresponding path program 1 times [2023-08-29 02:40:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747780261] [2023-08-29 02:40:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:33,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:40:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:40:33,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:40:33,842 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:40:33,842 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:40:33,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 02:40:33,842 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:40:33,843 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:40:33,843 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:40:33,843 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 02:40:33,877 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-29 02:40:33,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 224 transitions, 478 flow [2023-08-29 02:40:33,937 INFO L130 PetriNetUnfolder]: 50/450 cut-off events. [2023-08-29 02:40:33,937 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:40:33,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 450 events. 50/450 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 298. Up to 16 conditions per place. [2023-08-29 02:40:33,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 224 transitions, 478 flow [2023-08-29 02:40:33,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 224 transitions, 478 flow [2023-08-29 02:40:33,946 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:40:33,946 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 224 transitions, 478 flow [2023-08-29 02:40:33,947 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 224 transitions, 478 flow [2023-08-29 02:40:33,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 224 transitions, 478 flow [2023-08-29 02:40:33,997 INFO L130 PetriNetUnfolder]: 50/450 cut-off events. [2023-08-29 02:40:33,998 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:40:34,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 450 events. 50/450 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 298. Up to 16 conditions per place. [2023-08-29 02:40:34,017 INFO L119 LiptonReduction]: Number of co-enabled transitions 25872 [2023-08-29 02:40:36,678 INFO L134 LiptonReduction]: Checked pairs total: 109708 [2023-08-29 02:40:36,678 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-29 02:40:36,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:40:36,680 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:40:36,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-29 02:40:36,681 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2023-08-29 02:40:36,681 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:40:36,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:36,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:40:36,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:40:36,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash 44158138, now seen corresponding path program 1 times [2023-08-29 02:40:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278387767] [2023-08-29 02:40:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:36,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278387767] [2023-08-29 02:40:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278387767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:36,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152631713] [2023-08-29 02:40:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:36,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 356 [2023-08-29 02:40:36,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:36,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:36,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 356 [2023-08-29 02:40:36,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:40:41,357 INFO L130 PetriNetUnfolder]: 43367/72866 cut-off events. [2023-08-29 02:40:41,358 INFO L131 PetriNetUnfolder]: For 1379/1379 co-relation queries the response was YES. [2023-08-29 02:40:41,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134536 conditions, 72866 events. 43367/72866 cut-off events. For 1379/1379 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 661951 event pairs, 40167 based on Foata normal form. 11812/76437 useless extension candidates. Maximal degree in co-relation 56286. Up to 60642 conditions per place. [2023-08-29 02:40:41,736 INFO L137 encePairwiseOnDemand]: 331/356 looper letters, 58 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2023-08-29 02:40:41,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 105 transitions, 360 flow [2023-08-29 02:40:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:40:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:40:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2023-08-29 02:40:41,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170411985018727 [2023-08-29 02:40:41,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 659 transitions. [2023-08-29 02:40:41,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 659 transitions. [2023-08-29 02:40:41,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:40:41,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 659 transitions. [2023-08-29 02:40:41,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:41,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:41,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:41,747 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 260 flow. Second operand 3 states and 659 transitions. [2023-08-29 02:40:41,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 105 transitions, 360 flow [2023-08-29 02:40:41,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:40:41,750 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 228 flow [2023-08-29 02:40:41,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2023-08-29 02:40:41,751 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2023-08-29 02:40:41,751 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 228 flow [2023-08-29 02:40:41,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:41,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:40:41,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:40:41,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 02:40:41,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:40:41,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:40:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1757644115, now seen corresponding path program 1 times [2023-08-29 02:40:41,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:40:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138589396] [2023-08-29 02:40:41,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:40:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:40:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:40:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:40:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:40:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138589396] [2023-08-29 02:40:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138589396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:40:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:40:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:40:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30345863] [2023-08-29 02:40:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:40:41,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:40:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:40:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:40:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:40:41,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 356 [2023-08-29 02:40:41,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:40:41,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:40:41,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 356 [2023-08-29 02:40:41,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:41:08,457 INFO L130 PetriNetUnfolder]: 308262/462102 cut-off events. [2023-08-29 02:41:08,458 INFO L131 PetriNetUnfolder]: For 21376/21376 co-relation queries the response was YES. [2023-08-29 02:41:09,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914009 conditions, 462102 events. 308262/462102 cut-off events. For 21376/21376 co-relation queries the response was YES. Maximal size of possible extension queue 8069. Compared 4111911 event pairs, 124028 based on Foata normal form. 0/418304 useless extension candidates. Maximal degree in co-relation 913897. Up to 231260 conditions per place. [2023-08-29 02:41:10,934 INFO L137 encePairwiseOnDemand]: 329/356 looper letters, 111 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2023-08-29 02:41:10,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 155 transitions, 640 flow [2023-08-29 02:41:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:41:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:41:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2023-08-29 02:41:10,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596441947565543 [2023-08-29 02:41:10,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2023-08-29 02:41:10,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2023-08-29 02:41:10,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:41:10,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2023-08-29 02:41:10,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:10,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:10,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:10,941 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 228 flow. Second operand 3 states and 637 transitions. [2023-08-29 02:41:10,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 155 transitions, 640 flow [2023-08-29 02:41:10,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:41:10,973 INFO L231 Difference]: Finished difference. Result has 103 places, 114 transitions, 400 flow [2023-08-29 02:41:10,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=103, PETRI_TRANSITIONS=114} [2023-08-29 02:41:10,974 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2023-08-29 02:41:10,974 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 400 flow [2023-08-29 02:41:10,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:10,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:41:10,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:41:10,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 02:41:10,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:41:10,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:41:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1469999463, now seen corresponding path program 1 times [2023-08-29 02:41:10,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:41:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141058825] [2023-08-29 02:41:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:41:10,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:41:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:41:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:41:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:41:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141058825] [2023-08-29 02:41:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141058825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:41:10,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:41:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:41:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295080588] [2023-08-29 02:41:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:41:10,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:41:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:41:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:41:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:41:11,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 356 [2023-08-29 02:41:11,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:11,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:41:11,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 356 [2023-08-29 02:41:11,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:41:15,053 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1163] L702-7-->L702-8: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][103], [34#L709-4true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 157#L702-4true, 213#true, Black: 215#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 48#L702-8true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, 55#L702-10true]) [2023-08-29 02:41:15,053 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:41:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:41:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:41:15,053 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:41:15,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L702-5-->L702-7: Formula: (= v_~global~0_113 (+ |v_t_funThread3of3ForFork0_#t~post5_9| 1)) InVars {t_funThread3of3ForFork0_#t~post5=|v_t_funThread3of3ForFork0_#t~post5_9|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_13|, t_funThread3of3ForFork0_#t~post5=|v_t_funThread3of3ForFork0_#t~post5_9|, ~global~0=v_~global~0_113} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet6, ~global~0][113], [34#L709-4true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 3#L702-7true, 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 213#true, t_funThread1of3ForFork0InUse, 215#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, 92#L702-7true, t_funThread3of3ForFork0InUse, 55#L702-10true]) [2023-08-29 02:41:15,549 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:41:15,549 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:41:15,549 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:41:15,549 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:41:17,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][75], [101#ULTIMATE.startEXITtrue, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L702-17true, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, 71#L702-4true, t_funThread2of3ForFork0InUse, 215#(= |#race~global~0| 0), 219#true, t_funThread3of3ForFork0InUse]) [2023-08-29 02:41:17,673 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,673 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,673 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,673 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,673 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][75], [51#L711-9true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L702-17true, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, 71#L702-4true, t_funThread2of3ForFork0InUse, 215#(= |#race~global~0| 0), 219#true, t_funThread3of3ForFork0InUse]) [2023-08-29 02:41:17,673 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,673 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,673 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:17,674 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:38,376 INFO L130 PetriNetUnfolder]: 278526/430411 cut-off events. [2023-08-29 02:41:38,376 INFO L131 PetriNetUnfolder]: For 194644/196531 co-relation queries the response was YES. [2023-08-29 02:41:39,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025377 conditions, 430411 events. 278526/430411 cut-off events. For 194644/196531 co-relation queries the response was YES. Maximal size of possible extension queue 8955. Compared 4080475 event pairs, 185765 based on Foata normal form. 67/381357 useless extension candidates. Maximal degree in co-relation 178319. Up to 339044 conditions per place. [2023-08-29 02:41:41,042 INFO L137 encePairwiseOnDemand]: 343/356 looper letters, 100 selfloop transitions, 22 changer transitions 0/166 dead transitions. [2023-08-29 02:41:41,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 166 transitions, 826 flow [2023-08-29 02:41:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:41:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:41:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-29 02:41:41,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5898876404494382 [2023-08-29 02:41:41,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-29 02:41:41,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-29 02:41:41,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:41:41,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-29 02:41:41,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:41,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:41,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:41,049 INFO L175 Difference]: Start difference. First operand has 103 places, 114 transitions, 400 flow. Second operand 3 states and 630 transitions. [2023-08-29 02:41:41,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 166 transitions, 826 flow [2023-08-29 02:41:41,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 166 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:41:41,517 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 566 flow [2023-08-29 02:41:41,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2023-08-29 02:41:41,518 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2023-08-29 02:41:41,518 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 566 flow [2023-08-29 02:41:41,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:41,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:41:41,518 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:41:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 02:41:41,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:41:41,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:41:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -236069006, now seen corresponding path program 1 times [2023-08-29 02:41:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:41:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116309795] [2023-08-29 02:41:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:41:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:41:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:41:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:41:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:41:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116309795] [2023-08-29 02:41:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116309795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:41:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:41:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:41:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154036704] [2023-08-29 02:41:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:41:41,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:41:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:41:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:41:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:41:41,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 356 [2023-08-29 02:41:41,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:41:41,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:41:41,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 356 [2023-08-29 02:41:41,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:41:49,357 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 34#L709-4true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 199#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:49,358 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:41:49,358 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:49,358 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:49,358 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:41:50,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, Black: 213#true, 64#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:50,495 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:41:50,495 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:41:50,495 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:41:50,495 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:41:51,457 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, 26#L691-2true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:51,457 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,457 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,457 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,457 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 28#L691true, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:51,565 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,565 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,565 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:51,565 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:41:52,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L709-6true, 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:52,702 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 02:41:52,702 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:41:52,702 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:41:52,702 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:41:54,266 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, 45#L711-14true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:54,266 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event [2023-08-29 02:41:54,266 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:41:54,266 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:41:54,266 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 02:41:56,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, 101#ULTIMATE.startEXITtrue, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:56,313 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,314 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,314 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,314 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, 51#L711-9true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:41:56,324 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,324 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,325 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:41:56,325 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-29 02:42:02,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, 34#L709-4true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 138#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:02,554 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:02,554 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:02,554 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:02,555 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:03,438 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, 26#L691-2true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:03,438 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,438 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,438 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,438 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,689 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 28#L691true, Black: 213#true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:03,689 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,690 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,690 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:03,690 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:04,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L709-6true, 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:04,802 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is not cut-off event [2023-08-29 02:42:04,802 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:42:04,802 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:42:04,802 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is not cut-off event [2023-08-29 02:42:05,974 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, 56#L702-18true, 45#L711-14true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:05,975 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is not cut-off event [2023-08-29 02:42:05,975 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:42:05,975 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:42:05,975 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is not cut-off event [2023-08-29 02:42:06,167 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 34#L709-4true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 61#L702-24true, 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:06,167 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:42:06,167 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:06,167 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:06,167 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:07,099 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 225#true, 101#ULTIMATE.startEXITtrue, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:07,099 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,099 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,099 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,099 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 51#L711-9true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:07,109 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,109 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,109 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,109 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-29 02:42:07,398 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1196] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][99], [225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 175#L702-17true, Black: 213#true, 64#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 10#L702-28true]) [2023-08-29 02:42:07,398 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-29 02:42:07,398 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:42:07,398 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:42:07,398 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-29 02:42:08,370 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [75#L702-17true, 34#L709-4true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 190#L702-28true, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:08,370 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is not cut-off event [2023-08-29 02:42:08,370 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:42:08,370 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:42:08,370 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-29 02:42:08,371 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1152] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][105], [146#t_funEXITtrue, 75#L702-17true, 34#L709-4true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:08,371 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,371 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,371 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,371 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1196] L702-16-->L702-17: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][99], [225#true, 132#t_funEXITtrue, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 175#L702-17true, Black: 213#true, 64#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 219#true, t_funThread3of3ForFork0InUse, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:08,474 INFO L383 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,474 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,474 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:42:08,474 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-29 02:42:15,752 INFO L130 PetriNetUnfolder]: 316441/485986 cut-off events. [2023-08-29 02:42:15,752 INFO L131 PetriNetUnfolder]: For 332480/343332 co-relation queries the response was YES. [2023-08-29 02:42:16,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233381 conditions, 485986 events. 316441/485986 cut-off events. For 332480/343332 co-relation queries the response was YES. Maximal size of possible extension queue 10206. Compared 4628438 event pairs, 194229 based on Foata normal form. 216/423204 useless extension candidates. Maximal degree in co-relation 359301. Up to 385790 conditions per place. [2023-08-29 02:42:18,958 INFO L137 encePairwiseOnDemand]: 343/356 looper letters, 118 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2023-08-29 02:42:18,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 196 transitions, 1147 flow [2023-08-29 02:42:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2023-08-29 02:42:18,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5889513108614233 [2023-08-29 02:42:18,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 629 transitions. [2023-08-29 02:42:18,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 629 transitions. [2023-08-29 02:42:18,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:18,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 629 transitions. [2023-08-29 02:42:18,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:18,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:18,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:18,965 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 566 flow. Second operand 3 states and 629 transitions. [2023-08-29 02:42:18,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 196 transitions, 1147 flow [2023-08-29 02:42:33,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 196 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:33,027 INFO L231 Difference]: Finished difference. Result has 107 places, 164 transitions, 880 flow [2023-08-29 02:42:33,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=107, PETRI_TRANSITIONS=164} [2023-08-29 02:42:33,028 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2023-08-29 02:42:33,028 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 164 transitions, 880 flow [2023-08-29 02:42:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:33,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:33,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:42:33,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 02:42:33,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:42:33,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -118881859, now seen corresponding path program 1 times [2023-08-29 02:42:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575707306] [2023-08-29 02:42:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:42:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575707306] [2023-08-29 02:42:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575707306] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:42:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201933847] [2023-08-29 02:42:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:42:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:42:33,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:42:33,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 02:42:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:33,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:42:33,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:42:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:42:33,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:42:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:42:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201933847] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:42:33,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:42:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:42:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966894108] [2023-08-29 02:42:33,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:42:33,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:42:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:42:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:42:33,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 356 [2023-08-29 02:42:33,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 164 transitions, 880 flow. Second operand has 7 states, 7 states have (on average 191.85714285714286) internal successors, (1343), 7 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:33,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:33,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 356 [2023-08-29 02:42:33,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:34,078 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 157#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:34,078 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,078 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,078 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,078 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 157#L702-4true, t_funThread1of3ForFork0InUse, 71#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:34,145 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,145 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,146 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,146 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 02:42:34,286 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 157#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L702-27true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:34,286 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 02:42:34,286 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:42:34,286 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:42:34,286 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 02:42:34,292 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 157#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:34,292 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-29 02:42:34,292 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:34,292 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:34,292 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:34,292 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 02:42:34,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 157#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:34,484 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 02:42:34,484 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:42:34,484 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:42:34,484 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 02:42:34,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 157#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:34,886 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 02:42:34,886 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:42:34,886 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:42:34,886 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 02:42:35,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [162#L702-3true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,145 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-29 02:42:35,145 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:42:35,146 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:42:35,146 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-29 02:42:35,289 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 199#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,290 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,290 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,290 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,290 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,302 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,302 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,302 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,302 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,333 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, 35#L702-21true, Black: 213#true, 7#L702-27true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,333 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,333 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,333 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,333 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,372 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [162#L702-3true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,372 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,372 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,372 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,372 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [162#L702-3true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,375 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,375 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,375 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,375 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,376 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [162#L702-3true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,377 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,377 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,377 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,377 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,407 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 94#L702-8true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 175#L702-17true, 165#L707-13true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:35,407 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,407 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,407 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,407 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 02:42:35,407 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 175#L702-17true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:35,408 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,408 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,408 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,408 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-29 02:42:35,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [161#L702-16true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, 165#L707-13true, Black: 213#true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,502 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,502 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,502 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,502 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 199#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,531 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,531 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,531 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,532 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, 71#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,539 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,539 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,539 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,539 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, 71#L702-4true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,539 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,539 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,539 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,539 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,549 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,549 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,549 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,549 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,552 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,552 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,552 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,552 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,553 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [8#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,553 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,553 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,553 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,554 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 157#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,573 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,573 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,573 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,573 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 94#L702-8true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:35,586 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,586 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,586 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,586 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 02:42:35,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:35,587 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,587 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,587 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,587 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, 7#L702-27true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,609 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,609 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,609 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,609 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 94#L702-8true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, 7#L702-27true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:35,611 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,611 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,611 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,611 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-29 02:42:35,907 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, 165#L707-13true, Black: 213#true, 92#L702-7true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,907 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,907 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,907 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,907 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,928 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 161#L702-16true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 94#L702-8true, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:35,928 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,928 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,928 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,928 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,975 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 199#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 165#L707-13true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,975 INFO L383 tUnfolder$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-29 02:42:35,975 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:42:35,975 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:42:35,975 INFO L386 tUnfolder$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-29 02:42:35,975 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 199#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:35,975 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,975 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,975 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:35,975 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [161#L702-16true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, 22#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,051 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,052 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L702-27true, Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:36,054 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,054 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,054 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,054 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-29 02:42:36,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, 92#L702-7true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,147 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 02:42:36,147 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:42:36,147 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:42:36,147 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 02:42:36,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, 92#L702-7true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,147 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,148 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,148 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,148 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,155 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, 92#L702-7true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,155 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,156 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,156 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,156 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 3#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,184 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,184 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,184 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,184 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 3#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,188 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,188 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,188 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,188 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] L702-6-->L702-8: Formula: (= |v_#race~global~0_78| |v_t_funThread1of3ForFork0_#t~nondet6_13|) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet6=|v_t_funThread1of3ForFork0_#t~nondet6_13|, #race~global~0=|v_#race~global~0_78|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet6, #race~global~0][61], [Black: 219#true, 161#L702-16true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 94#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(= |#race~global~0| 0)]) [2023-08-29 02:42:36,195 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,196 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,196 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,196 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-29 02:42:36,207 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,207 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,207 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,207 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,207 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,248 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,249 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,249 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,249 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,249 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,249 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,320 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, 3#L702-7true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,320 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,320 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,320 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,320 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][135], [29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 41#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 116#L702-8true, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,369 INFO L383 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,369 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,369 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,369 INFO L386 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-29 02:42:36,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,374 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,374 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,374 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,374 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,462 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [114#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, 56#L702-18true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,462 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,462 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,462 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,462 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,462 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-29 02:42:36,726 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, 165#L707-13true, Black: 213#true, 7#L702-27true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:36,726 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-29 02:42:36,726 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-29 02:42:36,726 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-29 02:42:36,726 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-29 02:42:37,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [161#L702-16true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,108 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,108 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,108 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,108 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,118 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, 41#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,118 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,118 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,118 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,118 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 29#L702-17true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, 7#L702-27true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,164 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,164 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,164 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,164 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 175#L702-17true, 165#L707-13true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,197 INFO L383 tUnfolder$Statistics]: this new event has 50 ancestors and is not cut-off event [2023-08-29 02:42:37,197 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:42:37,197 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:42:37,197 INFO L386 tUnfolder$Statistics]: existing Event has 50 ancestors and is not cut-off event [2023-08-29 02:42:37,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 175#L702-17true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,197 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,197 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,197 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,197 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-29 02:42:37,282 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 138#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,283 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 41#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,283 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,283 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [161#L702-16true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,298 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,298 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,298 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,298 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [18#L702-18true, 29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 138#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,305 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,305 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,305 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,305 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1329] L702-15-->L702-17: Formula: (= |v_#race~global~0_90| 0) InVars {} OutVars{t_funThread1of3ForFork0_#t~nondet7=|v_t_funThread1of3ForFork0_#t~nondet7_7|, #race~global~0=|v_#race~global~0_90|} AuxVars[] AssignedVars[t_funThread1of3ForFork0_#t~nondet7, #race~global~0][181], [29#L702-17true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 41#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,306 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,306 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,306 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,306 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,312 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, 41#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,312 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,312 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,312 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,312 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,330 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 165#L707-13true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,330 INFO L383 tUnfolder$Statistics]: this new event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,330 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,330 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,331 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is not cut-off event [2023-08-29 02:42:37,331 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 145#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 56#L702-18true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,331 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,331 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,331 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,331 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-08-29 02:42:37,366 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [113#L702-21true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, 165#L707-13true, Black: 213#true, 7#L702-27true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,367 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,367 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,367 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,367 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 138#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 165#L707-13true, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,437 INFO L383 tUnfolder$Statistics]: this new event has 52 ancestors and is not cut-off event [2023-08-29 02:42:37,437 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:37,437 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:37,437 INFO L386 tUnfolder$Statistics]: existing Event has 52 ancestors and is not cut-off event [2023-08-29 02:42:37,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] L702-20-->L702-22: Formula: (= |v_#race~global~0_84| |v_t_funThread2of3ForFork0_#t~nondet9_15|) InVars {} OutVars{t_funThread2of3ForFork0_#t~nondet9=|v_t_funThread2of3ForFork0_#t~nondet9_15|, #race~global~0=|v_#race~global~0_84|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_#t~nondet9, #race~global~0][178], [Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 122#L702-27true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 195#L702-22true, 138#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 215#(= |#race~global~0| 0), Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,437 INFO L383 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,437 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,437 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,438 INFO L386 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-29 02:42:37,485 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [113#L702-21true, 161#L702-16true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 165#L707-13true, 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,485 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,485 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,485 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,486 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [113#L702-21true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, 7#L702-27true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,541 INFO L383 tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-29 02:42:37,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L702-19-->L702-21: Formula: (= (+ v_~global~0_109 1) |v_t_funThread3of3ForFork0_#t~post8_9|) InVars {t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|} OutVars{t_funThread3of3ForFork0_#t~nondet9=|v_t_funThread3of3ForFork0_#t~nondet9_15|, t_funThread3of3ForFork0_#t~post8=|v_t_funThread3of3ForFork0_#t~post8_9|, ~global~0=v_~global~0_109} AuxVars[] AssignedVars[t_funThread3of3ForFork0_#t~nondet9, ~global~0][166], [113#L702-21true, 161#L702-16true, Black: 227#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 311#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 225#true, 25#L707-7true, Black: 210#(= |ULTIMATE.start_main_~i~0#1| 0), 35#L702-21true, Black: 213#true, Black: 221#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|)]) [2023-08-29 02:42:37,648 INFO L383 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-29 02:42:37,648 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:37,648 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:37,648 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-29 02:42:38,390 INFO L130 PetriNetUnfolder]: 43141/74710 cut-off events. [2023-08-29 02:42:38,391 INFO L131 PetriNetUnfolder]: For 90819/99546 co-relation queries the response was YES. [2023-08-29 02:42:38,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206018 conditions, 74710 events. 43141/74710 cut-off events. For 90819/99546 co-relation queries the response was YES. Maximal size of possible extension queue 2388. Compared 718581 event pairs, 5657 based on Foata normal form. 7726/76555 useless extension candidates. Maximal degree in co-relation 55044. Up to 43138 conditions per place. [2023-08-29 02:42:38,834 INFO L137 encePairwiseOnDemand]: 353/356 looper letters, 155 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2023-08-29 02:42:38,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 238 transitions, 1511 flow [2023-08-29 02:42:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:42:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:42:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1238 transitions. [2023-08-29 02:42:38,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5795880149812734 [2023-08-29 02:42:38,837 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1238 transitions. [2023-08-29 02:42:38,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1238 transitions. [2023-08-29 02:42:38,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:38,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1238 transitions. [2023-08-29 02:42:38,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:38,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:38,844 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:38,844 INFO L175 Difference]: Start difference. First operand has 107 places, 164 transitions, 880 flow. Second operand 6 states and 1238 transitions. [2023-08-29 02:42:38,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 238 transitions, 1511 flow [2023-08-29 02:42:38,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 238 transitions, 1421 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:38,910 INFO L231 Difference]: Finished difference. Result has 97 places, 139 transitions, 689 flow [2023-08-29 02:42:38,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=689, PETRI_PLACES=97, PETRI_TRANSITIONS=139} [2023-08-29 02:42:38,911 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2023-08-29 02:42:38,911 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 139 transitions, 689 flow [2023-08-29 02:42:38,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 191.85714285714286) internal successors, (1343), 7 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:38,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:38,911 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-29 02:42:38,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-29 02:42:39,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:42:39,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:42:39,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1827731366, now seen corresponding path program 1 times [2023-08-29 02:42:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666859321] [2023-08-29 02:42:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:39,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:42:39,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:39,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666859321] [2023-08-29 02:42:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666859321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 02:42:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743339679] [2023-08-29 02:42:39,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:39,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 02:42:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 02:42:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 02:42:39,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 356 [2023-08-29 02:42:39,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 139 transitions, 689 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:39,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 356 [2023-08-29 02:42:39,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:39,427 INFO L130 PetriNetUnfolder]: 395/1431 cut-off events. [2023-08-29 02:42:39,427 INFO L131 PetriNetUnfolder]: For 1239/1239 co-relation queries the response was YES. [2023-08-29 02:42:39,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1431 events. 395/1431 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8723 event pairs, 44 based on Foata normal form. 378/1809 useless extension candidates. Maximal degree in co-relation 2213. Up to 810 conditions per place. [2023-08-29 02:42:39,433 INFO L137 encePairwiseOnDemand]: 349/356 looper letters, 37 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2023-08-29 02:42:39,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 77 transitions, 375 flow [2023-08-29 02:42:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 02:42:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 02:42:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 779 transitions. [2023-08-29 02:42:39,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470505617977528 [2023-08-29 02:42:39,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 779 transitions. [2023-08-29 02:42:39,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 779 transitions. [2023-08-29 02:42:39,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:39,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 779 transitions. [2023-08-29 02:42:39,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,453 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,453 INFO L175 Difference]: Start difference. First operand has 97 places, 139 transitions, 689 flow. Second operand 4 states and 779 transitions. [2023-08-29 02:42:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 77 transitions, 375 flow [2023-08-29 02:42:39,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 77 transitions, 280 flow, removed 28 selfloop flow, removed 9 redundant places. [2023-08-29 02:42:39,457 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 178 flow [2023-08-29 02:42:39,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2023-08-29 02:42:39,457 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -15 predicate places. [2023-08-29 02:42:39,457 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 178 flow [2023-08-29 02:42:39,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:39,458 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:42:39,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 02:42:39,458 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:42:39,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash 524262115, now seen corresponding path program 1 times [2023-08-29 02:42:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034920635] [2023-08-29 02:42:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 02:42:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034920635] [2023-08-29 02:42:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034920635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:39,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158005289] [2023-08-29 02:42:39,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:39,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:39,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:39,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 356 [2023-08-29 02:42:39,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:39,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 356 [2023-08-29 02:42:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:39,630 INFO L130 PetriNetUnfolder]: 481/1487 cut-off events. [2023-08-29 02:42:39,630 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2023-08-29 02:42:39,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1487 events. 481/1487 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8667 event pairs, 465 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1598. Up to 1059 conditions per place. [2023-08-29 02:42:39,633 INFO L137 encePairwiseOnDemand]: 353/356 looper letters, 45 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-29 02:42:39,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 72 transitions, 276 flow [2023-08-29 02:42:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2023-08-29 02:42:39,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5402621722846442 [2023-08-29 02:42:39,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2023-08-29 02:42:39,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2023-08-29 02:42:39,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:39,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2023-08-29 02:42:39,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,639 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 178 flow. Second operand 3 states and 577 transitions. [2023-08-29 02:42:39,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 72 transitions, 276 flow [2023-08-29 02:42:39,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 72 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:39,641 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 173 flow [2023-08-29 02:42:39,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2023-08-29 02:42:39,641 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -16 predicate places. [2023-08-29 02:42:39,642 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 173 flow [2023-08-29 02:42:39,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:39,642 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] [2023-08-29 02:42:39,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 02:42:39,642 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:42:39,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1444667468, now seen corresponding path program 1 times [2023-08-29 02:42:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354480876] [2023-08-29 02:42:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:42:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354480876] [2023-08-29 02:42:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354480876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:39,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996554367] [2023-08-29 02:42:39,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:39,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:39,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:39,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 356 [2023-08-29 02:42:39,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:39,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 356 [2023-08-29 02:42:39,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:39,828 INFO L130 PetriNetUnfolder]: 481/1466 cut-off events. [2023-08-29 02:42:39,829 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2023-08-29 02:42:39,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1466 events. 481/1466 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8454 event pairs, 447 based on Foata normal form. 0/1461 useless extension candidates. Maximal degree in co-relation 1917. Up to 1023 conditions per place. [2023-08-29 02:42:39,832 INFO L137 encePairwiseOnDemand]: 353/356 looper letters, 49 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-29 02:42:39,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 301 flow [2023-08-29 02:42:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-08-29 02:42:39,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5421348314606742 [2023-08-29 02:42:39,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-08-29 02:42:39,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-08-29 02:42:39,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:39,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-08-29 02:42:39,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,837 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 173 flow. Second operand 3 states and 579 transitions. [2023-08-29 02:42:39,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 301 flow [2023-08-29 02:42:39,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 75 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:39,839 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 171 flow [2023-08-29 02:42:39,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2023-08-29 02:42:39,840 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -17 predicate places. [2023-08-29 02:42:39,840 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 171 flow [2023-08-29 02:42:39,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:39,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:39,840 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] [2023-08-29 02:42:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 02:42:39,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:42:39,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1478222498, now seen corresponding path program 1 times [2023-08-29 02:42:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:39,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403626207] [2023-08-29 02:42:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 02:42:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403626207] [2023-08-29 02:42:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403626207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:39,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904414586] [2023-08-29 02:42:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:39,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:39,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 356 [2023-08-29 02:42:39,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 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-29 02:42:39,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:39,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 356 [2023-08-29 02:42:39,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:40,057 INFO L130 PetriNetUnfolder]: 481/1448 cut-off events. [2023-08-29 02:42:40,057 INFO L131 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2023-08-29 02:42:40,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1448 events. 481/1448 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8260 event pairs, 467 based on Foata normal form. 0/1443 useless extension candidates. Maximal degree in co-relation 1776. Up to 1067 conditions per place. [2023-08-29 02:42:40,061 INFO L137 encePairwiseOnDemand]: 353/356 looper letters, 44 selfloop transitions, 2 changer transitions 3/72 dead transitions. [2023-08-29 02:42:40,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 72 transitions, 284 flow [2023-08-29 02:42:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2023-08-29 02:42:40,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5411985018726592 [2023-08-29 02:42:40,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 578 transitions. [2023-08-29 02:42:40,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions. [2023-08-29 02:42:40,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:40,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions. [2023-08-29 02:42:40,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,066 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 171 flow. Second operand 3 states and 578 transitions. [2023-08-29 02:42:40,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 72 transitions, 284 flow [2023-08-29 02:42:40,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:40,068 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 162 flow [2023-08-29 02:42:40,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2023-08-29 02:42:40,069 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -18 predicate places. [2023-08-29 02:42:40,069 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 162 flow [2023-08-29 02:42:40,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 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-29 02:42:40,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:40,070 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:42:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 02:42:40,070 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-08-29 02:42:40,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -883379675, now seen corresponding path program 1 times [2023-08-29 02:42:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19092383] [2023-08-29 02:42:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 02:42:40,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:40,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19092383] [2023-08-29 02:42:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19092383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949902662] [2023-08-29 02:42:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:40,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:40,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:40,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 356 [2023-08-29 02:42:40,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:40,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 356 [2023-08-29 02:42:40,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:42:40,248 INFO L130 PetriNetUnfolder]: 357/1060 cut-off events. [2023-08-29 02:42:40,248 INFO L131 PetriNetUnfolder]: For 351/351 co-relation queries the response was YES. [2023-08-29 02:42:40,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 1060 events. 357/1060 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5657 event pairs, 349 based on Foata normal form. 12/1067 useless extension candidates. Maximal degree in co-relation 1396. Up to 787 conditions per place. [2023-08-29 02:42:40,250 INFO L137 encePairwiseOnDemand]: 354/356 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2023-08-29 02:42:40,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 254 flow [2023-08-29 02:42:40,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:42:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:42:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2023-08-29 02:42:40,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5374531835205992 [2023-08-29 02:42:40,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 574 transitions. [2023-08-29 02:42:40,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 574 transitions. [2023-08-29 02:42:40,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:42:40,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 574 transitions. [2023-08-29 02:42:40,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,254 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 162 flow. Second operand 3 states and 574 transitions. [2023-08-29 02:42:40,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 254 flow [2023-08-29 02:42:40,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 02:42:40,255 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2023-08-29 02:42:40,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=76, PETRI_TRANSITIONS=0} [2023-08-29 02:42:40,256 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -22 predicate places. [2023-08-29 02:42:40,256 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2023-08-29 02:42:40,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:40,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2023-08-29 02:42:40,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-08-29 02:42:40,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-08-29 02:42:40,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-08-29 02:42:40,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-08-29 02:42:40,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-08-29 02:42:40,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 02:42:40,259 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:42:40,260 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 02:42:40,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 224 transitions, 478 flow [2023-08-29 02:42:40,426 INFO L130 PetriNetUnfolder]: 50/450 cut-off events. [2023-08-29 02:42:40,427 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:42:40,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 450 events. 50/450 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 298. Up to 16 conditions per place. [2023-08-29 02:42:40,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 224 transitions, 478 flow [2023-08-29 02:42:40,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 224 transitions, 478 flow [2023-08-29 02:42:40,430 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:42:40,430 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 224 transitions, 478 flow [2023-08-29 02:42:40,430 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 224 transitions, 478 flow [2023-08-29 02:42:40,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 224 transitions, 478 flow [2023-08-29 02:42:40,459 INFO L130 PetriNetUnfolder]: 50/450 cut-off events. [2023-08-29 02:42:40,459 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-08-29 02:42:40,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 450 events. 50/450 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 1 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 298. Up to 16 conditions per place. [2023-08-29 02:42:40,472 INFO L119 LiptonReduction]: Number of co-enabled transitions 25872 [2023-08-29 02:42:42,857 INFO L134 LiptonReduction]: Checked pairs total: 109649 [2023-08-29 02:42:42,858 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-29 02:42:42,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 02:42:42,859 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:42:42,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 02:42:42,864 INFO L130 PetriNetUnfolder]: 18/119 cut-off events. [2023-08-29 02:42:42,864 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 02:42:42,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:42,864 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 02:42:42,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 02:42:42,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1380996271, now seen corresponding path program 1 times [2023-08-29 02:42:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888410195] [2023-08-29 02:42:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:42:42,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 02:42:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 02:42:42,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 02:42:42,885 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 02:42:42,885 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 02:42:42,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 02:42:42,886 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 02:42:42,886 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 02:42:42,886 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 02:42:42,886 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 02:42:42,914 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 02:42:42,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 270 transitions, 584 flow [2023-08-29 02:42:42,984 INFO L130 PetriNetUnfolder]: 81/698 cut-off events. [2023-08-29 02:42:42,984 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:42:42,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 698 events. 81/698 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2933 event pairs, 6 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 470. Up to 32 conditions per place. [2023-08-29 02:42:42,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 270 transitions, 584 flow [2023-08-29 02:42:42,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 270 transitions, 584 flow [2023-08-29 02:42:42,995 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:42:42,995 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 270 transitions, 584 flow [2023-08-29 02:42:42,995 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 270 transitions, 584 flow [2023-08-29 02:42:42,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 270 transitions, 584 flow [2023-08-29 02:42:43,070 INFO L130 PetriNetUnfolder]: 81/698 cut-off events. [2023-08-29 02:42:43,070 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 02:42:43,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 698 events. 81/698 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2933 event pairs, 6 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 470. Up to 32 conditions per place. [2023-08-29 02:42:43,099 INFO L119 LiptonReduction]: Number of co-enabled transitions 42768 [2023-08-29 02:42:45,618 INFO L134 LiptonReduction]: Checked pairs total: 187158 [2023-08-29 02:42:45,618 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-08-29 02:42:45,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:42:45,622 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;@4bfa16dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:42:45,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-29 02:42:45,625 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-29 02:42:45,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:42:45,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:42:45,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 02:42:45,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 02:42:45,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:42:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 62504288, now seen corresponding path program 1 times [2023-08-29 02:42:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:42:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761302674] [2023-08-29 02:42:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:42:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:42:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:42:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:42:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:42:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761302674] [2023-08-29 02:42:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761302674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:42:45,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:42:45,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:42:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391996034] [2023-08-29 02:42:45,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:42:45,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:42:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:42:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:42:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:42:45,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 419 [2023-08-29 02:42:45,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:42:45,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:42:45,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 419 [2023-08-29 02:42:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:44:10,511 INFO L130 PetriNetUnfolder]: 667680/1004653 cut-off events. [2023-08-29 02:44:10,511 INFO L131 PetriNetUnfolder]: For 26112/26112 co-relation queries the response was YES. [2023-08-29 02:44:14,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884266 conditions, 1004653 events. 667680/1004653 cut-off events. For 26112/26112 co-relation queries the response was YES. Maximal size of possible extension queue 19365. Compared 10180227 event pairs, 492876 based on Foata normal form. 218495/1128947 useless extension candidates. Maximal degree in co-relation 136090. Up to 864805 conditions per place. [2023-08-29 02:44:20,842 INFO L137 encePairwiseOnDemand]: 388/419 looper letters, 70 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2023-08-29 02:44:20,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 130 transitions, 448 flow [2023-08-29 02:44:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:44:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:44:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-08-29 02:44:20,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6292760540970564 [2023-08-29 02:44:20,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-08-29 02:44:20,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-08-29 02:44:20,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:44:20,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-08-29 02:44:20,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:44:20,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:44:20,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:44:20,855 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 336 flow. Second operand 3 states and 791 transitions. [2023-08-29 02:44:20,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 130 transitions, 448 flow [2023-08-29 02:44:20,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:44:20,869 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 292 flow [2023-08-29 02:44:20,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2023-08-29 02:44:20,870 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 2 predicate places. [2023-08-29 02:44:20,870 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 292 flow [2023-08-29 02:44:20,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:44:20,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:44:20,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:44:20,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 02:44:20,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 02:44:20,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:44:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash 494523287, now seen corresponding path program 1 times [2023-08-29 02:44:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:44:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86376163] [2023-08-29 02:44:20,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:44:20,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:44:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:44:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:44:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:44:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86376163] [2023-08-29 02:44:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86376163] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:44:20,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:44:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:44:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971236201] [2023-08-29 02:44:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:44:20,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:44:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:44:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:44:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:44:21,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 419 [2023-08-29 02:44:21,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:44:21,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:44:21,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 419 [2023-08-29 02:44:21,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand