./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 03:41:57,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 03:41:57,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 03:41:57,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 03:41:57,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 03:41:57,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 03:41:57,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 03:41:57,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 03:41:57,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 03:41:57,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 03:41:57,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 03:41:57,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 03:41:57,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 03:41:57,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 03:41:57,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 03:41:57,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 03:41:57,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 03:41:57,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 03:41:57,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 03:41:57,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 03:41:57,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 03:41:57,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 03:41:57,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 03:41:57,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 03:41:57,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 03:41:57,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 03:41:57,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 03:41:57,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 03:41:57,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 03:41:57,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 03:41:57,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 03:41:57,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 03:41:57,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 03:41:57,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 03:41:57,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 03:41:57,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 03:41:57,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 03:41:57,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 03:41:57,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 03:41:57,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 03:41:57,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 03:41:57,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 03:41:57,989 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 03:41:57,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 03:41:57,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 03:41:57,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 03:41:57,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 03:41:57,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 03:41:57,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 03:41:57,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 03:41:57,993 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 03:41:57,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 03:41:57,994 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 03:41:57,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 03:41:57,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 03:41:57,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 03:41:57,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 03:41:57,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 03:41:57,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 03:41:57,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 03:41:57,995 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 03:41:57,995 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 03:41:57,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 03:41:57,996 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 03:41:57,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 03:41:57,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 03:41:57,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 03:41:57,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 03:41:57,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:41:57,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 03:41:57,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 03:41:57,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 03:41:57,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 03:41:57,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 03:41:57,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 03:41:57,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 03:41:57,998 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 03:41:57,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 03:41:57,999 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 03:41:57,999 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 -> 3ea4ca0f63ee44295abb2f56a10a45cd5c3c9aada41df664ec74c618092ddbca Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 03:41:58,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 03:41:58,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 03:41:58,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 03:41:58,349 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 03:41:58,349 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 03:41:58,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-29 03:41:59,516 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 03:41:59,749 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 03:41:59,750 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-29 03:41:59,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bbb3655/55749d3bd6704442a330b25e4f23bfa2/FLAG7c4664471 [2023-08-29 03:41:59,774 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bbb3655/55749d3bd6704442a330b25e4f23bfa2 [2023-08-29 03:41:59,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 03:41:59,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 03:41:59,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 03:41:59,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 03:41:59,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 03:41:59,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:41:59" (1/1) ... [2023-08-29 03:41:59,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9d589b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:41:59, skipping insertion in model container [2023-08-29 03:41:59,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 03:41:59" (1/1) ... [2023-08-29 03:41:59,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 03:41:59,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 03:42:00,035 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-29 03:42:00,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:42:00,049 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 03:42:00,093 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-29 03:42:00,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 03:42:00,103 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 03:42:00,104 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 03:42:00,110 INFO L208 MainTranslator]: Completed translation [2023-08-29 03:42:00,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00 WrapperNode [2023-08-29 03:42:00,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 03:42:00,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 03:42:00,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 03:42:00,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 03:42:00,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,184 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2023-08-29 03:42:00,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 03:42:00,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 03:42:00,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 03:42:00,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 03:42:00,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 03:42:00,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 03:42:00,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 03:42:00,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 03:42:00,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (1/1) ... [2023-08-29 03:42:00,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 03:42:00,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 03:42:00,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 03:42:00,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 03:42:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 03:42:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 03:42:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 03:42:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 03:42:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 03:42:00,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 03:42:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 03:42:00,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 03:42:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 03:42:00,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 03:42:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-29 03:42:00,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-29 03:42:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 03:42:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 03:42:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 03:42:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 03:42:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 03:42:00,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 03:42:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 03:42:00,334 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 03:42:00,505 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 03:42:00,506 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 03:42:01,051 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 03:42:01,409 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 03:42:01,410 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-29 03:42:01,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:42:01 BoogieIcfgContainer [2023-08-29 03:42:01,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 03:42:01,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 03:42:01,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 03:42:01,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 03:42:01,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 03:41:59" (1/3) ... [2023-08-29 03:42:01,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2666b587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:42:01, skipping insertion in model container [2023-08-29 03:42:01,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 03:42:00" (2/3) ... [2023-08-29 03:42:01,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2666b587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 03:42:01, skipping insertion in model container [2023-08-29 03:42:01,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:42:01" (3/3) ... [2023-08-29 03:42:01,422 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-08-29 03:42:01,430 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 03:42:01,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 03:42:01,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-08-29 03:42:01,439 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 03:42:01,541 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 03:42:01,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 253 transitions, 538 flow [2023-08-29 03:42:01,697 INFO L130 PetriNetUnfolder]: 12/249 cut-off events. [2023-08-29 03:42:01,698 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 03:42:01,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 249 events. 12/249 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 375 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2023-08-29 03:42:01,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 253 transitions, 538 flow [2023-08-29 03:42:01,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 230 transitions, 484 flow [2023-08-29 03:42:01,721 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 03:42:01,732 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 230 transitions, 484 flow [2023-08-29 03:42:01,735 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 230 transitions, 484 flow [2023-08-29 03:42:01,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 230 transitions, 484 flow [2023-08-29 03:42:01,793 INFO L130 PetriNetUnfolder]: 11/230 cut-off events. [2023-08-29 03:42:01,794 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 03:42:01,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 230 events. 11/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 369 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2023-08-29 03:42:01,803 INFO L119 LiptonReduction]: Number of co-enabled transitions 9284 [2023-08-29 03:42:10,980 INFO L134 LiptonReduction]: Checked pairs total: 57872 [2023-08-29 03:42:10,981 INFO L136 LiptonReduction]: Total number of compositions: 172 [2023-08-29 03:42:10,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 03:42:10,996 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;@1d9f4b7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 03:42:10,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2023-08-29 03:42:10,998 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 03:42:10,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 03:42:10,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:10,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 03:42:10,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:11,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1253, now seen corresponding path program 1 times [2023-08-29 03:42:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255898183] [2023-08-29 03:42:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:42:11,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:11,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255898183] [2023-08-29 03:42:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255898183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:11,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:11,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 03:42:11,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579825035] [2023-08-29 03:42:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:11,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 03:42:11,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 03:42:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 03:42:11,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 425 [2023-08-29 03:42:11,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 195.5) internal successors, (391), 2 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:11,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:11,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 425 [2023-08-29 03:42:11,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:11,555 INFO L130 PetriNetUnfolder]: 1372/2545 cut-off events. [2023-08-29 03:42:11,555 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-29 03:42:11,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4585 conditions, 2545 events. 1372/2545 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15296 event pairs, 926 based on Foata normal form. 426/2523 useless extension candidates. Maximal degree in co-relation 3906. Up to 1830 conditions per place. [2023-08-29 03:42:11,572 INFO L137 encePairwiseOnDemand]: 382/425 looper letters, 27 selfloop transitions, 0 changer transitions 3/57 dead transitions. [2023-08-29 03:42:11,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 198 flow [2023-08-29 03:42:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 03:42:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 03:42:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2023-08-29 03:42:11,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447058823529412 [2023-08-29 03:42:11,589 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2023-08-29 03:42:11,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2023-08-29 03:42:11,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:11,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2023-08-29 03:42:11,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 231.5) internal successors, (463), 2 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 03:42:11,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 425.0) internal successors, (1275), 3 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:11,604 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 425.0) internal successors, (1275), 3 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:11,605 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 224 flow. Second operand 2 states and 463 transitions. [2023-08-29 03:42:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 198 flow [2023-08-29 03:42:11,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 03:42:11,615 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 114 flow [2023-08-29 03:42:11,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-08-29 03:42:11,623 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2023-08-29 03:42:11,624 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 114 flow [2023-08-29 03:42:11,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 195.5) internal successors, (391), 2 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:11,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:11,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:11,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 03:42:11,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:11,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -740888009, now seen corresponding path program 1 times [2023-08-29 03:42:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:11,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957939642] [2023-08-29 03:42:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:42:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957939642] [2023-08-29 03:42:11,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957939642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:11,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:11,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:42:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638551541] [2023-08-29 03:42:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:11,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:11,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 425 [2023-08-29 03:42:11,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 114 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 03:42:11,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:11,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 425 [2023-08-29 03:42:11,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:12,385 INFO L130 PetriNetUnfolder]: 3689/5847 cut-off events. [2023-08-29 03:42:12,386 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-29 03:42:12,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11056 conditions, 5847 events. 3689/5847 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 31048 event pairs, 3038 based on Foata normal form. 0/4987 useless extension candidates. Maximal degree in co-relation 11053. Up to 4983 conditions per place. [2023-08-29 03:42:12,432 INFO L137 encePairwiseOnDemand]: 421/425 looper letters, 31 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-29 03:42:12,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 172 flow [2023-08-29 03:42:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-08-29 03:42:12,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44862745098039214 [2023-08-29 03:42:12,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-08-29 03:42:12,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-08-29 03:42:12,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:12,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-08-29 03:42:12,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:12,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:12,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:12,442 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 114 flow. Second operand 3 states and 572 transitions. [2023-08-29 03:42:12,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 172 flow [2023-08-29 03:42:12,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 03:42:12,445 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 110 flow [2023-08-29 03:42:12,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-08-29 03:42:12,446 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -51 predicate places. [2023-08-29 03:42:12,446 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 110 flow [2023-08-29 03:42:12,446 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 03:42:12,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:12,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:12,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 03:42:12,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:12,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1841899931, now seen corresponding path program 1 times [2023-08-29 03:42:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976761491] [2023-08-29 03:42:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 03:42:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976761491] [2023-08-29 03:42:12,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976761491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:12,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:12,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 03:42:12,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290621273] [2023-08-29 03:42:12,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:12,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 03:42:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 03:42:12,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 03:42:12,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 425 [2023-08-29 03:42:12,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:12,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:12,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 425 [2023-08-29 03:42:12,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:13,009 INFO L130 PetriNetUnfolder]: 1370/2486 cut-off events. [2023-08-29 03:42:13,010 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 03:42:13,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4400 conditions, 2486 events. 1370/2486 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14582 event pairs, 924 based on Foata normal form. 0/2088 useless extension candidates. Maximal degree in co-relation 4396. Up to 1823 conditions per place. [2023-08-29 03:42:13,023 INFO L137 encePairwiseOnDemand]: 422/425 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-29 03:42:13,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 168 flow [2023-08-29 03:42:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 03:42:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 03:42:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2023-08-29 03:42:13,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47215686274509805 [2023-08-29 03:42:13,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 602 transitions. [2023-08-29 03:42:13,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 602 transitions. [2023-08-29 03:42:13,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:13,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 602 transitions. [2023-08-29 03:42:13,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:13,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:13,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 425.0) internal successors, (1700), 4 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:13,032 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 110 flow. Second operand 3 states and 602 transitions. [2023-08-29 03:42:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 168 flow [2023-08-29 03:42:13,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:13,034 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 121 flow [2023-08-29 03:42:13,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-29 03:42:13,035 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -49 predicate places. [2023-08-29 03:42:13,035 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 121 flow [2023-08-29 03:42:13,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:13,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:13,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:13,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 03:42:13,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:13,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:13,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1668434185, now seen corresponding path program 1 times [2023-08-29 03:42:13,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:13,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192989958] [2023-08-29 03:42:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:13,463 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 03:42:13,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192989958] [2023-08-29 03:42:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192989958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:13,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:42:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808840223] [2023-08-29 03:42:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:42:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:42:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:42:13,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 425 [2023-08-29 03:42:13,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:13,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:13,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 425 [2023-08-29 03:42:13,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:14,689 INFO L130 PetriNetUnfolder]: 5362/7438 cut-off events. [2023-08-29 03:42:14,689 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-29 03:42:14,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14470 conditions, 7438 events. 5362/7438 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 37375 event pairs, 2006 based on Foata normal form. 0/6776 useless extension candidates. Maximal degree in co-relation 14465. Up to 4178 conditions per place. [2023-08-29 03:42:14,737 INFO L137 encePairwiseOnDemand]: 418/425 looper letters, 81 selfloop transitions, 9 changer transitions 0/108 dead transitions. [2023-08-29 03:42:14,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 108 transitions, 415 flow [2023-08-29 03:42:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:42:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:42:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1182 transitions. [2023-08-29 03:42:14,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46352941176470586 [2023-08-29 03:42:14,741 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1182 transitions. [2023-08-29 03:42:14,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1182 transitions. [2023-08-29 03:42:14,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:14,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1182 transitions. [2023-08-29 03:42:14,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:14,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:14,786 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:14,786 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 121 flow. Second operand 6 states and 1182 transitions. [2023-08-29 03:42:14,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 108 transitions, 415 flow [2023-08-29 03:42:14,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 411 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:14,791 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 181 flow [2023-08-29 03:42:14,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-08-29 03:42:14,793 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-29 03:42:14,793 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 181 flow [2023-08-29 03:42:14,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:14,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:14,794 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 03:42:14,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 03:42:14,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:14,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1999440658, now seen corresponding path program 1 times [2023-08-29 03:42:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337182000] [2023-08-29 03:42:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:15,195 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 03:42:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:15,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337182000] [2023-08-29 03:42:15,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337182000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:15,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:15,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 03:42:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257578374] [2023-08-29 03:42:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:15,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 03:42:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 03:42:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:42:15,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 425 [2023-08-29 03:42:15,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 181 flow. Second operand has 9 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:15,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:15,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 425 [2023-08-29 03:42:15,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:16,734 INFO L130 PetriNetUnfolder]: 5082/7158 cut-off events. [2023-08-29 03:42:16,735 INFO L131 PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES. [2023-08-29 03:42:16,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16632 conditions, 7158 events. 5082/7158 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 36497 event pairs, 858 based on Foata normal form. 80/6684 useless extension candidates. Maximal degree in co-relation 16623. Up to 2230 conditions per place. [2023-08-29 03:42:16,767 INFO L137 encePairwiseOnDemand]: 419/425 looper letters, 81 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2023-08-29 03:42:16,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 459 flow [2023-08-29 03:42:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 03:42:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 03:42:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1327 transitions. [2023-08-29 03:42:16,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44605042016806723 [2023-08-29 03:42:16,771 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1327 transitions. [2023-08-29 03:42:16,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1327 transitions. [2023-08-29 03:42:16,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:16,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1327 transitions. [2023-08-29 03:42:16,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.57142857142858) internal successors, (1327), 7 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:16,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 425.0) internal successors, (3400), 8 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:16,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 425.0) internal successors, (3400), 8 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:16,781 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 181 flow. Second operand 7 states and 1327 transitions. [2023-08-29 03:42:16,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 459 flow [2023-08-29 03:42:16,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:16,819 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 190 flow [2023-08-29 03:42:16,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-29 03:42:16,820 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -36 predicate places. [2023-08-29 03:42:16,820 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 190 flow [2023-08-29 03:42:16,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:16,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:16,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:16,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 03:42:16,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:16,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 518073546, now seen corresponding path program 1 times [2023-08-29 03:42:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372056560] [2023-08-29 03:42:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:16,888 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 03:42:16,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:16,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372056560] [2023-08-29 03:42:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372056560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:16,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:42:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015092160] [2023-08-29 03:42:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:16,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 03:42:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 03:42:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 03:42:16,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 425 [2023-08-29 03:42:16,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:16,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:16,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 425 [2023-08-29 03:42:16,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:17,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 6#L114-6true, 269#true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 241#$Ultimate##0true, Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 103#L56-6true, 93#thread4EXITtrue]) [2023-08-29 03:42:17,382 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 03:42:17,385 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:17,387 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:17,388 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:17,388 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 6#L114-6true, 105#L84-6true, 97#L57true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 241#$Ultimate##0true, Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 93#thread4EXITtrue]) [2023-08-29 03:42:17,388 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 03:42:17,388 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:17,388 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:17,388 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:17,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 6#L114-6true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 118#L68true, Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 103#L56-6true, 93#thread4EXITtrue]) [2023-08-29 03:42:17,416 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 03:42:17,416 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:17,417 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:17,417 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:17,417 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 6#L114-6true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 97#L57true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 118#L68true, Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 93#thread4EXITtrue]) [2023-08-29 03:42:17,417 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 03:42:17,417 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 03:42:17,418 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 03:42:17,418 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:17,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 6#L114-6true, 105#L84-6true, 97#L57true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 93#thread4EXITtrue]) [2023-08-29 03:42:17,454 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 03:42:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:17,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 6#L114-6true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 103#L56-6true, 93#thread4EXITtrue]) [2023-08-29 03:42:17,455 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 03:42:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:17,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 6#L114-6true, 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#L84-6true, Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 103#L56-6true, 93#thread4EXITtrue, 126#thread2EXITtrue]) [2023-08-29 03:42:17,511 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 03:42:17,511 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:17,511 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:17,511 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:17,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 6#L114-6true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 269#true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 97#L57true, Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, 93#thread4EXITtrue, 126#thread2EXITtrue]) [2023-08-29 03:42:17,511 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 03:42:17,511 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 03:42:17,512 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 03:42:17,512 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 03:42:17,591 INFO L130 PetriNetUnfolder]: 3614/5856 cut-off events. [2023-08-29 03:42:17,592 INFO L131 PetriNetUnfolder]: For 2518/2542 co-relation queries the response was YES. [2023-08-29 03:42:17,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13253 conditions, 5856 events. 3614/5856 cut-off events. For 2518/2542 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 36391 event pairs, 1491 based on Foata normal form. 0/5061 useless extension candidates. Maximal degree in co-relation 13244. Up to 3271 conditions per place. [2023-08-29 03:42:17,629 INFO L137 encePairwiseOnDemand]: 421/425 looper letters, 49 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-29 03:42:17,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 354 flow [2023-08-29 03:42:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 03:42:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 03:42:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 804 transitions. [2023-08-29 03:42:17,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47294117647058825 [2023-08-29 03:42:17,636 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 804 transitions. [2023-08-29 03:42:17,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 804 transitions. [2023-08-29 03:42:17,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:17,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 804 transitions. [2023-08-29 03:42:17,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:17,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 425.0) internal successors, (2125), 5 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:17,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 425.0) internal successors, (2125), 5 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:17,642 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 190 flow. Second operand 4 states and 804 transitions. [2023-08-29 03:42:17,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 354 flow [2023-08-29 03:42:17,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:42:17,653 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 190 flow [2023-08-29 03:42:17,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-08-29 03:42:17,655 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-29 03:42:17,656 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 190 flow [2023-08-29 03:42:17,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:17,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:17,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:17,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 03:42:17,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:17,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash -229035611, now seen corresponding path program 1 times [2023-08-29 03:42:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159737353] [2023-08-29 03:42:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 03:42:18,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159737353] [2023-08-29 03:42:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159737353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:18,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:42:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862872598] [2023-08-29 03:42:18,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:18,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:42:18,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:42:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:42:18,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 425 [2023-08-29 03:42:18,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:18,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:18,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 425 [2023-08-29 03:42:18,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:19,185 INFO L130 PetriNetUnfolder]: 4206/6544 cut-off events. [2023-08-29 03:42:19,185 INFO L131 PetriNetUnfolder]: For 3303/3331 co-relation queries the response was YES. [2023-08-29 03:42:19,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15560 conditions, 6544 events. 4206/6544 cut-off events. For 3303/3331 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38752 event pairs, 2153 based on Foata normal form. 0/5928 useless extension candidates. Maximal degree in co-relation 15550. Up to 4774 conditions per place. [2023-08-29 03:42:19,233 INFO L137 encePairwiseOnDemand]: 418/425 looper letters, 64 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2023-08-29 03:42:19,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 441 flow [2023-08-29 03:42:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:42:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:42:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1160 transitions. [2023-08-29 03:42:19,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4549019607843137 [2023-08-29 03:42:19,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1160 transitions. [2023-08-29 03:42:19,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1160 transitions. [2023-08-29 03:42:19,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:19,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1160 transitions. [2023-08-29 03:42:19,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:19,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:19,248 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:19,248 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 190 flow. Second operand 6 states and 1160 transitions. [2023-08-29 03:42:19,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 441 flow [2023-08-29 03:42:19,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 98 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:42:19,265 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 296 flow [2023-08-29 03:42:19,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-29 03:42:19,266 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -29 predicate places. [2023-08-29 03:42:19,266 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 296 flow [2023-08-29 03:42:19,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:19,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:19,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:19,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 03:42:19,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:19,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1720167382, now seen corresponding path program 1 times [2023-08-29 03:42:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:19,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59242501] [2023-08-29 03:42:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 03:42:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59242501] [2023-08-29 03:42:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59242501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:19,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 03:42:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688391514] [2023-08-29 03:42:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:19,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 03:42:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 03:42:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:42:20,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 425 [2023-08-29 03:42:20,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 296 flow. Second operand has 9 states, 9 states have (on average 180.66666666666666) internal successors, (1626), 9 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:20,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:20,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 425 [2023-08-29 03:42:20,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:20,792 INFO L130 PetriNetUnfolder]: 4166/6488 cut-off events. [2023-08-29 03:42:20,792 INFO L131 PetriNetUnfolder]: For 5389/5417 co-relation queries the response was YES. [2023-08-29 03:42:20,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16853 conditions, 6488 events. 4166/6488 cut-off events. For 5389/5417 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38365 event pairs, 2013 based on Foata normal form. 16/5906 useless extension candidates. Maximal degree in co-relation 16839. Up to 4317 conditions per place. [2023-08-29 03:42:20,833 INFO L137 encePairwiseOnDemand]: 419/425 looper letters, 70 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2023-08-29 03:42:20,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 520 flow [2023-08-29 03:42:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 03:42:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 03:42:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1307 transitions. [2023-08-29 03:42:20,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.439327731092437 [2023-08-29 03:42:20,837 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1307 transitions. [2023-08-29 03:42:20,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1307 transitions. [2023-08-29 03:42:20,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:20,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1307 transitions. [2023-08-29 03:42:20,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:20,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 425.0) internal successors, (3400), 8 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:20,846 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 425.0) internal successors, (3400), 8 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:20,846 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 296 flow. Second operand 7 states and 1307 transitions. [2023-08-29 03:42:20,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 520 flow [2023-08-29 03:42:20,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:20,867 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 304 flow [2023-08-29 03:42:20,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2023-08-29 03:42:20,868 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -25 predicate places. [2023-08-29 03:42:20,868 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 304 flow [2023-08-29 03:42:20,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 180.66666666666666) internal successors, (1626), 9 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:20,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:20,869 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:20,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 03:42:20,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:20,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash -564961988, now seen corresponding path program 1 times [2023-08-29 03:42:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166110904] [2023-08-29 03:42:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:20,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 03:42:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166110904] [2023-08-29 03:42:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166110904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:20,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:20,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 03:42:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327918877] [2023-08-29 03:42:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:20,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 03:42:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 03:42:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 03:42:20,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 425 [2023-08-29 03:42:20,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:20,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:20,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 425 [2023-08-29 03:42:20,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:21,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 6#L114-6true, 269#true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 93#thread4EXITtrue, Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 121#$Ultimate##0true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,474 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 03:42:21,474 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 03:42:21,474 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:21,474 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 03:42:21,506 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 44#L50true, 262#(= |#race~N~0| 0), 269#true, 6#L114-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#L84-6true, 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 93#thread4EXITtrue, Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,506 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 03:42:21,506 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:21,506 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:21,507 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 03:42:21,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 6#L114-6true, 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 105#L84-6true, 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 103#L56-6true, Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 93#thread4EXITtrue, Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,538 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 03:42:21,538 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:21,538 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:21,538 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 03:42:21,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 6#L114-6true, 105#L84-6true, 97#L57true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 93#thread4EXITtrue, Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,601 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 03:42:21,601 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 03:42:21,601 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:21,601 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:21,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 269#true, 6#L114-6true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 103#L56-6true, 93#thread4EXITtrue, Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,634 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 03:42:21,634 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 03:42:21,634 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 03:42:21,634 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 03:42:21,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 6#L114-6true, 269#true, 97#L57true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 93#thread4EXITtrue, Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,680 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 03:42:21,680 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:21,680 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 03:42:21,680 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 03:42:21,687 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1187] L84-2-->L84-6: Formula: (let ((.cse6 (* |v_thread3Thread1of1ForFork3_~i~2#1_44| 4))) (let ((.cse7 (select |v_#memory_int_271| v_~A~0.base_317)) (.cse1 (+ v_~A~0.offset_317 .cse6))) (let ((.cse0 (select .cse7 .cse1))) (and (= |v_thread3Thread1of1ForFork3_~i~2#1_43| (+ |v_thread3Thread1of1ForFork3_~i~2#1_44| 1)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| (ite (< 0 (+ .cse0 2147483648)) 1 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|) (= (store |v_#race_700| v_~A~0.base_317 (let ((.cse4 (+ v_~A~0.offset_317 3 .cse6))) (let ((.cse5 (select (select |v_#race_699| v_~A~0.base_317) .cse4))) (store (let ((.cse3 (+ v_~A~0.offset_317 2 .cse6))) (store (let ((.cse2 (+ v_~A~0.offset_317 .cse6 1))) (store (store (store (store (store (store (store (store (store (store (select |v_#race_700| v_~A~0.base_317) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse1 .cse5) .cse2 .cse5)) .cse3 .cse5)) .cse4 .cse5)))) |v_#race_699|) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19| 0)) (< |v_thread3Thread1of1ForFork3_~i~2#1_44| v_~N~0_69) (= |v_#race~A~0_274| 0) (= (store |v_#memory_int_271| v_~A~0.base_317 (store .cse7 .cse1 (+ (- 1) .cse0))) |v_#memory_int_270|))))) InVars {#race=|v_#race_700|, ~A~0.base=v_~A~0.base_317, ~A~0.offset=v_~A~0.offset_317, #memory_int=|v_#memory_int_271|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_44|} OutVars{#race=|v_#race_699|, ~A~0.base=v_~A~0.base_317, thread3Thread1of1ForFork3_#t~post20#1=|v_thread3Thread1of1ForFork3_#t~post20#1_11|, ~N~0=v_~N~0_69, thread3Thread1of1ForFork3_#t~nondet21#1=|v_thread3Thread1of1ForFork3_#t~nondet21#1_11|, thread3Thread1of1ForFork3_#t~mem19#1=|v_thread3Thread1of1ForFork3_#t~mem19#1_15|, thread3Thread1of1ForFork3_~i~2#1=|v_thread3Thread1of1ForFork3_~i~2#1_43|, ~A~0.offset=v_~A~0.offset_317, thread3Thread1of1ForFork3_#t~mem18#1=|v_thread3Thread1of1ForFork3_#t~mem18#1_23|, #memory_int=|v_#memory_int_270|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_19|, thread3Thread1of1ForFork3_#t~post17#1=|v_thread3Thread1of1ForFork3_#t~post17#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_19|, #race~A~0=|v_#race~A~0_274|} AuxVars[] AssignedVars[#race, thread3Thread1of1ForFork3_#t~post20#1, thread3Thread1of1ForFork3_#t~mem18#1, #memory_int, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post17#1, thread3Thread1of1ForFork3_#t~nondet21#1, thread3Thread1of1ForFork3_#t~mem19#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_~i~2#1, #race~A~0][58], [299#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 262#(= |#race~N~0| 0), 190#thread1EXITtrue, 269#true, 6#L114-6true, 105#L84-6true, Black: 266#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 174#L74-6true, 329#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 304#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 271#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 272#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 273#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 257#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 93#thread4EXITtrue, Black: 309#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 307#true, 342#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0))]) [2023-08-29 03:42:21,687 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 03:42:21,687 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 03:42:21,687 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 03:42:21,687 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 03:42:21,836 INFO L130 PetriNetUnfolder]: 4855/8203 cut-off events. [2023-08-29 03:42:21,836 INFO L131 PetriNetUnfolder]: For 7520/7548 co-relation queries the response was YES. [2023-08-29 03:42:21,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20463 conditions, 8203 events. 4855/8203 cut-off events. For 7520/7548 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 56188 event pairs, 2161 based on Foata normal form. 320/7824 useless extension candidates. Maximal degree in co-relation 20449. Up to 4871 conditions per place. [2023-08-29 03:42:21,890 INFO L137 encePairwiseOnDemand]: 421/425 looper letters, 67 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2023-08-29 03:42:21,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 584 flow [2023-08-29 03:42:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 03:42:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 03:42:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 804 transitions. [2023-08-29 03:42:21,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47294117647058825 [2023-08-29 03:42:21,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 804 transitions. [2023-08-29 03:42:21,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 804 transitions. [2023-08-29 03:42:21,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:21,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 804 transitions. [2023-08-29 03:42:21,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:21,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 425.0) internal successors, (2125), 5 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:21,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 425.0) internal successors, (2125), 5 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:21,899 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 304 flow. Second operand 4 states and 804 transitions. [2023-08-29 03:42:21,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 584 flow [2023-08-29 03:42:21,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 100 transitions, 570 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 03:42:21,921 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 304 flow [2023-08-29 03:42:21,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-29 03:42:21,922 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -26 predicate places. [2023-08-29 03:42:21,922 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 304 flow [2023-08-29 03:42:21,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:21,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:21,923 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:21,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 03:42:21,923 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:21,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1606233630, now seen corresponding path program 1 times [2023-08-29 03:42:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461322094] [2023-08-29 03:42:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 03:42:22,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461322094] [2023-08-29 03:42:22,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461322094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:22,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:22,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 03:42:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565185799] [2023-08-29 03:42:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:22,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 03:42:22,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:22,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 03:42:22,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 03:42:22,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 425 [2023-08-29 03:42:22,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:22,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:22,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 425 [2023-08-29 03:42:22,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:23,269 INFO L130 PetriNetUnfolder]: 4694/7593 cut-off events. [2023-08-29 03:42:23,269 INFO L131 PetriNetUnfolder]: For 8976/9011 co-relation queries the response was YES. [2023-08-29 03:42:23,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21053 conditions, 7593 events. 4694/7593 cut-off events. For 8976/9011 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 48819 event pairs, 2691 based on Foata normal form. 0/6851 useless extension candidates. Maximal degree in co-relation 21038. Up to 5855 conditions per place. [2023-08-29 03:42:23,363 INFO L137 encePairwiseOnDemand]: 418/425 looper letters, 50 selfloop transitions, 16 changer transitions 6/96 dead transitions. [2023-08-29 03:42:23,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 96 transitions, 556 flow [2023-08-29 03:42:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 03:42:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 03:42:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2023-08-29 03:42:23,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44784313725490194 [2023-08-29 03:42:23,367 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1142 transitions. [2023-08-29 03:42:23,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1142 transitions. [2023-08-29 03:42:23,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:23,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1142 transitions. [2023-08-29 03:42:23,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:23,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:23,375 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 425.0) internal successors, (2975), 7 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:23,376 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 304 flow. Second operand 6 states and 1142 transitions. [2023-08-29 03:42:23,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 96 transitions, 556 flow [2023-08-29 03:42:23,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 03:42:23,399 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 453 flow [2023-08-29 03:42:23,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-29 03:42:23,400 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -19 predicate places. [2023-08-29 03:42:23,400 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 453 flow [2023-08-29 03:42:23,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:23,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 03:42:23,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:23,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 03:42:23,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2023-08-29 03:42:23,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 03:42:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1945093739, now seen corresponding path program 1 times [2023-08-29 03:42:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 03:42:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557762019] [2023-08-29 03:42:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 03:42:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 03:42:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 03:42:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-29 03:42:23,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 03:42:23,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557762019] [2023-08-29 03:42:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557762019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 03:42:23,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 03:42:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 03:42:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348969450] [2023-08-29 03:42:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 03:42:23,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 03:42:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 03:42:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 03:42:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 03:42:24,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 425 [2023-08-29 03:42:24,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 181.33333333333334) internal successors, (1632), 9 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:24,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 03:42:24,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 425 [2023-08-29 03:42:24,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 03:42:25,010 INFO L130 PetriNetUnfolder]: 4659/7532 cut-off events. [2023-08-29 03:42:25,011 INFO L131 PetriNetUnfolder]: For 10774/10809 co-relation queries the response was YES. [2023-08-29 03:42:25,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21580 conditions, 7532 events. 4659/7532 cut-off events. For 10774/10809 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 48559 event pairs, 2671 based on Foata normal form. 4/6800 useless extension candidates. Maximal degree in co-relation 21561. Up to 5762 conditions per place. [2023-08-29 03:42:25,029 INFO L137 encePairwiseOnDemand]: 419/425 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2023-08-29 03:42:25,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 643 flow [2023-08-29 03:42:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 03:42:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 03:42:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1290 transitions. [2023-08-29 03:42:25,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336134453781513 [2023-08-29 03:42:25,033 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1290 transitions. [2023-08-29 03:42:25,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1290 transitions. [2023-08-29 03:42:25,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 03:42:25,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1290 transitions. [2023-08-29 03:42:25,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.28571428571428) internal successors, (1290), 7 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:25,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 425.0) internal successors, (3400), 8 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:25,041 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 425.0) internal successors, (3400), 8 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:25,041 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 453 flow. Second operand 7 states and 1290 transitions. [2023-08-29 03:42:25,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 643 flow [2023-08-29 03:42:25,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 03:42:25,090 INFO L231 Difference]: Finished difference. Result has 90 places, 0 transitions, 0 flow [2023-08-29 03:42:25,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=90, PETRI_TRANSITIONS=0} [2023-08-29 03:42:25,091 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -16 predicate places. [2023-08-29 03:42:25,091 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 0 transitions, 0 flow [2023-08-29 03:42:25,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 181.33333333333334) internal successors, (1632), 9 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 03:42:25,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (85 of 86 remaining) [2023-08-29 03:42:25,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 86 remaining) [2023-08-29 03:42:25,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 86 remaining) [2023-08-29 03:42:25,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 86 remaining) [2023-08-29 03:42:25,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 86 remaining) [2023-08-29 03:42:25,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 86 remaining) [2023-08-29 03:42:25,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 86 remaining) [2023-08-29 03:42:25,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 86 remaining) [2023-08-29 03:42:25,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (77 of 86 remaining) [2023-08-29 03:42:25,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (76 of 86 remaining) [2023-08-29 03:42:25,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (75 of 86 remaining) [2023-08-29 03:42:25,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (74 of 86 remaining) [2023-08-29 03:42:25,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (73 of 86 remaining) [2023-08-29 03:42:25,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (72 of 86 remaining) [2023-08-29 03:42:25,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 86 remaining) [2023-08-29 03:42:25,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (70 of 86 remaining) [2023-08-29 03:42:25,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (69 of 86 remaining) [2023-08-29 03:42:25,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (68 of 86 remaining) [2023-08-29 03:42:25,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (67 of 86 remaining) [2023-08-29 03:42:25,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (66 of 86 remaining) [2023-08-29 03:42:25,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (65 of 86 remaining) [2023-08-29 03:42:25,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 86 remaining) [2023-08-29 03:42:25,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 86 remaining) [2023-08-29 03:42:25,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (62 of 86 remaining) [2023-08-29 03:42:25,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (61 of 86 remaining) [2023-08-29 03:42:25,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (60 of 86 remaining) [2023-08-29 03:42:25,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (59 of 86 remaining) [2023-08-29 03:42:25,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (58 of 86 remaining) [2023-08-29 03:42:25,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (57 of 86 remaining) [2023-08-29 03:42:25,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (56 of 86 remaining) [2023-08-29 03:42:25,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 86 remaining) [2023-08-29 03:42:25,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 86 remaining) [2023-08-29 03:42:25,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 86 remaining) [2023-08-29 03:42:25,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 86 remaining) [2023-08-29 03:42:25,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 86 remaining) [2023-08-29 03:42:25,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 86 remaining) [2023-08-29 03:42:25,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 86 remaining) [2023-08-29 03:42:25,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 86 remaining) [2023-08-29 03:42:25,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 86 remaining) [2023-08-29 03:42:25,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (46 of 86 remaining) [2023-08-29 03:42:25,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 86 remaining) [2023-08-29 03:42:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 86 remaining) [2023-08-29 03:42:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 86 remaining) [2023-08-29 03:42:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 86 remaining) [2023-08-29 03:42:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (41 of 86 remaining) [2023-08-29 03:42:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (40 of 86 remaining) [2023-08-29 03:42:25,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (39 of 86 remaining) [2023-08-29 03:42:25,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (38 of 86 remaining) [2023-08-29 03:42:25,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (37 of 86 remaining) [2023-08-29 03:42:25,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (36 of 86 remaining) [2023-08-29 03:42:25,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 86 remaining) [2023-08-29 03:42:25,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 86 remaining) [2023-08-29 03:42:25,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 86 remaining) [2023-08-29 03:42:25,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 86 remaining) [2023-08-29 03:42:25,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 86 remaining) [2023-08-29 03:42:25,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 86 remaining) [2023-08-29 03:42:25,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 86 remaining) [2023-08-29 03:42:25,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (24 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 86 remaining) [2023-08-29 03:42:25,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 86 remaining) [2023-08-29 03:42:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 86 remaining) [2023-08-29 03:42:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 86 remaining) [2023-08-29 03:42:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 86 remaining) [2023-08-29 03:42:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 86 remaining) [2023-08-29 03:42:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 86 remaining) [2023-08-29 03:42:25,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 86 remaining) [2023-08-29 03:42:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 86 remaining) [2023-08-29 03:42:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 86 remaining) [2023-08-29 03:42:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 86 remaining) [2023-08-29 03:42:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 86 remaining) [2023-08-29 03:42:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 86 remaining) [2023-08-29 03:42:25,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 86 remaining) [2023-08-29 03:42:25,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 86 remaining) [2023-08-29 03:42:25,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 86 remaining) [2023-08-29 03:42:25,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 86 remaining) [2023-08-29 03:42:25,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (5 of 86 remaining) [2023-08-29 03:42:25,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (4 of 86 remaining) [2023-08-29 03:42:25,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (3 of 86 remaining) [2023-08-29 03:42:25,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (2 of 86 remaining) [2023-08-29 03:42:25,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (1 of 86 remaining) [2023-08-29 03:42:25,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (0 of 86 remaining) [2023-08-29 03:42:25,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 03:42:25,120 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 03:42:25,124 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 03:42:25,124 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 03:42:25,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 03:42:25 BasicIcfg [2023-08-29 03:42:25,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 03:42:25,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 03:42:25,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 03:42:25,128 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 03:42:25,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 03:42:01" (3/4) ... [2023-08-29 03:42:25,130 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-08-29 03:42:25,134 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-08-29 03:42:25,134 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-08-29 03:42:25,135 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-08-29 03:42:25,135 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2023-08-29 03:42:25,140 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-08-29 03:42:25,140 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-08-29 03:42:25,140 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-08-29 03:42:25,141 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-08-29 03:42:25,186 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-29 03:42:25,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 03:42:25,186 INFO L158 Benchmark]: Toolchain (without parser) took 25409.28ms. Allocated memory was 71.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 46.4MB in the beginning and 916.0MB in the end (delta: -869.6MB). Peak memory consumption was 370.9MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,187 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 03:42:25,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.42ms. Allocated memory is still 71.3MB. Free memory was 46.2MB in the beginning and 50.2MB in the end (delta: -4.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.61ms. Allocated memory is still 71.3MB. Free memory was 50.2MB in the beginning and 47.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,188 INFO L158 Benchmark]: Boogie Preprocessor took 73.75ms. Allocated memory is still 71.3MB. Free memory was 47.3MB in the beginning and 44.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,188 INFO L158 Benchmark]: RCFGBuilder took 1152.93ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 44.3MB in the beginning and 46.5MB in the end (delta: -2.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,188 INFO L158 Benchmark]: TraceAbstraction took 23711.48ms. Allocated memory was 86.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 46.0MB in the beginning and 920.2MB in the end (delta: -874.2MB). Peak memory consumption was 354.1MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,189 INFO L158 Benchmark]: Witness Printer took 58.12ms. Allocated memory is still 1.3GB. Free memory was 920.2MB in the beginning and 916.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 03:42:25,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.42ms. Allocated memory is still 71.3MB. Free memory was 46.2MB in the beginning and 50.2MB in the end (delta: -4.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.61ms. Allocated memory is still 71.3MB. Free memory was 50.2MB in the beginning and 47.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.75ms. Allocated memory is still 71.3MB. Free memory was 47.3MB in the beginning and 44.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1152.93ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 44.3MB in the beginning and 46.5MB in the end (delta: -2.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23711.48ms. Allocated memory was 86.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 46.0MB in the beginning and 920.2MB in the end (delta: -874.2MB). Peak memory consumption was 354.1MB. Max. memory is 16.1GB. * Witness Printer took 58.12ms. Allocated memory is still 1.3GB. Free memory was 920.2MB in the beginning and 916.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 232 PlacesBefore, 106 PlacesAfterwards, 230 TransitionsBefore, 100 TransitionsAfterwards, 9284 CoEnabledTransitionPairs, 8 FixpointIterations, 92 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 172 TotalNumberOfCompositions, 57872 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27366, independent: 26402, independent conditional: 0, independent unconditional: 26402, dependent: 964, dependent conditional: 0, dependent unconditional: 964, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4632, independent: 4471, independent conditional: 0, independent unconditional: 4471, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27366, independent: 21931, independent conditional: 0, independent unconditional: 21931, dependent: 803, dependent conditional: 0, dependent unconditional: 803, unknown: 4632, unknown conditional: 0, unknown unconditional: 4632] , Statistics on independence cache: Total cache size (in pairs): 1389, Positive cache size: 1311, Positive conditional cache size: 0, Positive unconditional cache size: 1311, Negative cache size: 78, Negative conditional cache size: 0, Negative unconditional cache size: 78, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 323 locations, 86 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1362 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 946 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3298 IncrementalHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 24 mSDtfsCounter, 3298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-29 03:42:25,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE