./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c 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 /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 16:36:19,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 16:36:19,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 16:36:19,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 16:36:19,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 16:36:19,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 16:36:19,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 16:36:19,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 16:36:19,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 16:36:19,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 16:36:19,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 16:36:19,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 16:36:19,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 16:36:19,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 16:36:19,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 16:36:19,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 16:36:19,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 16:36:19,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 16:36:19,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 16:36:19,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 16:36:19,646 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 16:36:19,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 16:36:19,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 16:36:19,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 16:36:19,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 16:36:19,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 16:36:19,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 16:36:19,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 16:36:19,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 16:36:19,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 16:36:19,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 16:36:19,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 16:36:19,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 16:36:19,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 16:36:19,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 16:36:19,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 16:36:19,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 16:36:19,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 16:36:19,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 16:36:19,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 16:36:19,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 16:36:19,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 16:36:19,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 16:36:19,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 16:36:19,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 16:36:19,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 16:36:19,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 16:36:19,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 16:36:19,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 16:36:19,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 16:36:19,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 16:36:19,698 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 16:36:19,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 16:36:19,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 16:36:19,699 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 16:36:19,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 16:36:19,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 16:36:19,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 16:36:19,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 16:36:19,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 16:36:19,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 16:36:19,701 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 16:36:19,701 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 16:36:19,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 16:36:19,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 16:36:19,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 16:36:19,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 16:36:19,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 16:36:19,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 16:36:19,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:36:19,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 16:36:19,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 16:36:19,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 16:36:19,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 16:36:19,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 16:36:19,703 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 16:36:19,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 16:36:19,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 16:36:19,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-04-18 16:36:19,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 16:36:19,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 16:36:19,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 16:36:19,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 16:36:19,957 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 16:36:19,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-04-18 16:36:20,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bac992a/b112531c524f4c40abd1281de8f3c313/FLAG5608fb18a [2022-04-18 16:36:20,402 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 16:36:20,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-04-18 16:36:20,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bac992a/b112531c524f4c40abd1281de8f3c313/FLAG5608fb18a [2022-04-18 16:36:20,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bac992a/b112531c524f4c40abd1281de8f3c313 [2022-04-18 16:36:20,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 16:36:20,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 16:36:20,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 16:36:20,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 16:36:20,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 16:36:20,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:36:20" (1/1) ... [2022-04-18 16:36:20,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c6e2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:20, skipping insertion in model container [2022-04-18 16:36:20,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:36:20" (1/1) ... [2022-04-18 16:36:20,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 16:36:20,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 16:36:21,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-04-18 16:36:21,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:36:21,012 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 16:36:21,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-04-18 16:36:21,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:36:21,057 INFO L208 MainTranslator]: Completed translation [2022-04-18 16:36:21,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21 WrapperNode [2022-04-18 16:36:21,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 16:36:21,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 16:36:21,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 16:36:21,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 16:36:21,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,103 INFO L137 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 172 [2022-04-18 16:36:21,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 16:36:21,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 16:36:21,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 16:36:21,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 16:36:21,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 16:36:21,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 16:36:21,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 16:36:21,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 16:36:21,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (1/1) ... [2022-04-18 16:36:21,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:36:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:36:21,178 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) [2022-04-18 16:36:21,189 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 [2022-04-18 16:36:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 16:36:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 16:36:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 16:36:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 16:36:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 16:36:21,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 16:36:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 16:36:21,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 16:36:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 16:36:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 16:36:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 16:36:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 16:36:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 16:36:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 16:36:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 16:36:21,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 16:36:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 16:36:21,228 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 16:36:21,305 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 16:36:21,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 16:36:21,707 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 16:36:21,826 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 16:36:21,826 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-18 16:36:21,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:21 BoogieIcfgContainer [2022-04-18 16:36:21,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 16:36:21,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 16:36:21,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 16:36:21,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 16:36:21,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 04:36:20" (1/3) ... [2022-04-18 16:36:21,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b0f8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:36:21, skipping insertion in model container [2022-04-18 16:36:21,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:36:21" (2/3) ... [2022-04-18 16:36:21,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b0f8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:36:21, skipping insertion in model container [2022-04-18 16:36:21,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:36:21" (3/3) ... [2022-04-18 16:36:21,838 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-04-18 16:36:21,842 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 16:36:21,842 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 16:36:21,842 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-04-18 16:36:21,842 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 16:36:21,919 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 16:36:21,978 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 16:36:21,984 INFO L340 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 [2022-04-18 16:36:21,985 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-04-18 16:36:21,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 279 places, 285 transitions, 594 flow [2022-04-18 16:36:22,063 INFO L129 PetriNetUnfolder]: 16/282 cut-off events. [2022-04-18 16:36:22,064 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 16:36:22,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 282 events. 16/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2022-04-18 16:36:22,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 285 transitions, 594 flow [2022-04-18 16:36:22,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 262 transitions, 542 flow [2022-04-18 16:36:22,089 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2022-04-18 16:36:22,090 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:36:22,090 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:22,091 INFO L255 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] [2022-04-18 16:36:22,091 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash -956837861, now seen corresponding path program 1 times [2022-04-18 16:36:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:22,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608114935] [2022-04-18 16:36:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:22,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:22,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608114935] [2022-04-18 16:36:22,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608114935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:22,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:22,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464276624] [2022-04-18 16:36:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:22,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:22,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:22,352 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 285 [2022-04-18 16:36:22,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 262 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:22,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:22,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 285 [2022-04-18 16:36:22,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:22,698 INFO L129 PetriNetUnfolder]: 452/1339 cut-off events. [2022-04-18 16:36:22,698 INFO L130 PetriNetUnfolder]: For 158/321 co-relation queries the response was YES. [2022-04-18 16:36:22,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1339 events. 452/1339 cut-off events. For 158/321 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8189 event pairs, 311 based on Foata normal form. 6/1038 useless extension candidates. Maximal degree in co-relation 1813. Up to 643 conditions per place. [2022-04-18 16:36:22,718 INFO L132 encePairwiseOnDemand]: 263/285 looper letters, 30 selfloop transitions, 2 changer transitions 4/242 dead transitions. [2022-04-18 16:36:22,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 566 flow [2022-04-18 16:36:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2022-04-18 16:36:22,736 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8678362573099415 [2022-04-18 16:36:22,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2022-04-18 16:36:22,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2022-04-18 16:36:22,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:22,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2022-04-18 16:36:22,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:22,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:22,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:22,757 INFO L186 Difference]: Start difference. First operand has 257 places, 262 transitions, 542 flow. Second operand 3 states and 742 transitions. [2022-04-18 16:36:22,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 566 flow [2022-04-18 16:36:22,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 242 transitions, 554 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-04-18 16:36:22,769 INFO L242 Difference]: Finished difference. Result has 242 places, 238 transitions, 486 flow [2022-04-18 16:36:22,771 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2022-04-18 16:36:22,774 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -15 predicate places. [2022-04-18 16:36:22,774 INFO L478 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 486 flow [2022-04-18 16:36:22,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:22,776 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:22,776 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:22,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 16:36:22,777 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash -379582126, now seen corresponding path program 1 times [2022-04-18 16:36:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:22,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760321310] [2022-04-18 16:36:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:22,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:22,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760321310] [2022-04-18 16:36:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760321310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:22,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:22,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999167579] [2022-04-18 16:36:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:22,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:22,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:22,858 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2022-04-18 16:36:22,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:22,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:22,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2022-04-18 16:36:22,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:23,063 INFO L129 PetriNetUnfolder]: 262/950 cut-off events. [2022-04-18 16:36:23,063 INFO L130 PetriNetUnfolder]: For 32/121 co-relation queries the response was YES. [2022-04-18 16:36:23,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 950 events. 262/950 cut-off events. For 32/121 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5242 event pairs, 164 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 1306. Up to 365 conditions per place. [2022-04-18 16:36:23,074 INFO L132 encePairwiseOnDemand]: 278/285 looper letters, 21 selfloop transitions, 1 changer transitions 2/232 dead transitions. [2022-04-18 16:36:23,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 520 flow [2022-04-18 16:36:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2022-04-18 16:36:23,076 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8514619883040936 [2022-04-18 16:36:23,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 728 transitions. [2022-04-18 16:36:23,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 728 transitions. [2022-04-18 16:36:23,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:23,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 728 transitions. [2022-04-18 16:36:23,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,082 INFO L186 Difference]: Start difference. First operand has 242 places, 238 transitions, 486 flow. Second operand 3 states and 728 transitions. [2022-04-18 16:36:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 520 flow [2022-04-18 16:36:23,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:23,092 INFO L242 Difference]: Finished difference. Result has 232 places, 230 transitions, 468 flow [2022-04-18 16:36:23,092 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2022-04-18 16:36:23,094 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -25 predicate places. [2022-04-18 16:36:23,094 INFO L478 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 468 flow [2022-04-18 16:36:23,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,095 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:23,095 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:23,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 16:36:23,096 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1223527727, now seen corresponding path program 1 times [2022-04-18 16:36:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919113753] [2022-04-18 16:36:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:23,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:23,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919113753] [2022-04-18 16:36:23,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919113753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:23,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:23,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303530839] [2022-04-18 16:36:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:23,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:23,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:23,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:23,308 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 285 [2022-04-18 16:36:23,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:23,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 285 [2022-04-18 16:36:23,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:23,833 INFO L129 PetriNetUnfolder]: 1300/2551 cut-off events. [2022-04-18 16:36:23,834 INFO L130 PetriNetUnfolder]: For 9/60 co-relation queries the response was YES. [2022-04-18 16:36:23,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4461 conditions, 2551 events. 1300/2551 cut-off events. For 9/60 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16081 event pairs, 1040 based on Foata normal form. 0/2189 useless extension candidates. Maximal degree in co-relation 4428. Up to 1868 conditions per place. [2022-04-18 16:36:23,864 INFO L132 encePairwiseOnDemand]: 273/285 looper letters, 56 selfloop transitions, 10 changer transitions 0/228 dead transitions. [2022-04-18 16:36:23,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 228 transitions, 596 flow [2022-04-18 16:36:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2022-04-18 16:36:23,868 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7274853801169591 [2022-04-18 16:36:23,868 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2022-04-18 16:36:23,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2022-04-18 16:36:23,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:23,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2022-04-18 16:36:23,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,876 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,876 INFO L186 Difference]: Start difference. First operand has 232 places, 230 transitions, 468 flow. Second operand 6 states and 1244 transitions. [2022-04-18 16:36:23,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 228 transitions, 596 flow [2022-04-18 16:36:23,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 228 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:23,882 INFO L242 Difference]: Finished difference. Result has 232 places, 228 transitions, 483 flow [2022-04-18 16:36:23,882 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=232, PETRI_TRANSITIONS=228} [2022-04-18 16:36:23,883 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -25 predicate places. [2022-04-18 16:36:23,883 INFO L478 AbstractCegarLoop]: Abstraction has has 232 places, 228 transitions, 483 flow [2022-04-18 16:36:23,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:23,885 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:23,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 16:36:23,885 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash -633740637, now seen corresponding path program 1 times [2022-04-18 16:36:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784947772] [2022-04-18 16:36:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:23,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784947772] [2022-04-18 16:36:23,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784947772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:23,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:23,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697577937] [2022-04-18 16:36:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:23,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:23,928 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-04-18 16:36:23,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 228 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:23,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:23,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-04-18 16:36:23,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:24,084 INFO L129 PetriNetUnfolder]: 133/744 cut-off events. [2022-04-18 16:36:24,085 INFO L130 PetriNetUnfolder]: For 26/30 co-relation queries the response was YES. [2022-04-18 16:36:24,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 744 events. 133/744 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3894 event pairs, 74 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 932. Up to 189 conditions per place. [2022-04-18 16:36:24,092 INFO L132 encePairwiseOnDemand]: 282/285 looper letters, 16 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2022-04-18 16:36:24,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 517 flow [2022-04-18 16:36:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2022-04-18 16:36:24,099 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8818713450292398 [2022-04-18 16:36:24,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 754 transitions. [2022-04-18 16:36:24,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 754 transitions. [2022-04-18 16:36:24,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:24,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 754 transitions. [2022-04-18 16:36:24,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,104 INFO L186 Difference]: Start difference. First operand has 232 places, 228 transitions, 483 flow. Second operand 3 states and 754 transitions. [2022-04-18 16:36:24,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 517 flow [2022-04-18 16:36:24,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 227 transitions, 497 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:24,110 INFO L242 Difference]: Finished difference. Result has 228 places, 227 transitions, 465 flow [2022-04-18 16:36:24,111 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2022-04-18 16:36:24,112 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -29 predicate places. [2022-04-18 16:36:24,112 INFO L478 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 465 flow [2022-04-18 16:36:24,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:24,113 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:24,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 16:36:24,114 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 65499299, now seen corresponding path program 1 times [2022-04-18 16:36:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:24,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827767028] [2022-04-18 16:36:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:24,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827767028] [2022-04-18 16:36:24,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827767028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:24,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:24,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291177620] [2022-04-18 16:36:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:24,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:24,212 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-04-18 16:36:24,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:24,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-04-18 16:36:24,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:24,288 INFO L129 PetriNetUnfolder]: 44/356 cut-off events. [2022-04-18 16:36:24,289 INFO L130 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-04-18 16:36:24,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 356 events. 44/356 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 983 event pairs, 20 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 398. Up to 64 conditions per place. [2022-04-18 16:36:24,292 INFO L132 encePairwiseOnDemand]: 282/285 looper letters, 13 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2022-04-18 16:36:24,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 493 flow [2022-04-18 16:36:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2022-04-18 16:36:24,294 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-04-18 16:36:24,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2022-04-18 16:36:24,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2022-04-18 16:36:24,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:24,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2022-04-18 16:36:24,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,299 INFO L186 Difference]: Start difference. First operand has 228 places, 227 transitions, 465 flow. Second operand 3 states and 760 transitions. [2022-04-18 16:36:24,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 493 flow [2022-04-18 16:36:24,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:24,304 INFO L242 Difference]: Finished difference. Result has 227 places, 226 transitions, 463 flow [2022-04-18 16:36:24,305 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-04-18 16:36:24,305 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2022-04-18 16:36:24,305 INFO L478 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 463 flow [2022-04-18 16:36:24,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:24,307 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:24,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 16:36:24,307 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 335773767, now seen corresponding path program 1 times [2022-04-18 16:36:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:24,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807491439] [2022-04-18 16:36:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:24,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807491439] [2022-04-18 16:36:24,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807491439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:24,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:24,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:24,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974175447] [2022-04-18 16:36:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:24,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:24,354 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-04-18 16:36:24,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:24,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-04-18 16:36:24,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:24,539 INFO L129 PetriNetUnfolder]: 173/855 cut-off events. [2022-04-18 16:36:24,539 INFO L130 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2022-04-18 16:36:24,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 855 events. 173/855 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4789 event pairs, 74 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 1108. Up to 175 conditions per place. [2022-04-18 16:36:24,547 INFO L132 encePairwiseOnDemand]: 280/285 looper letters, 19 selfloop transitions, 2 changer transitions 2/230 dead transitions. [2022-04-18 16:36:24,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 517 flow [2022-04-18 16:36:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-04-18 16:36:24,549 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2022-04-18 16:36:24,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 759 transitions. [2022-04-18 16:36:24,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 759 transitions. [2022-04-18 16:36:24,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:24,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 759 transitions. [2022-04-18 16:36:24,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,554 INFO L186 Difference]: Start difference. First operand has 227 places, 226 transitions, 463 flow. Second operand 3 states and 759 transitions. [2022-04-18 16:36:24,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 517 flow [2022-04-18 16:36:24,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 230 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:24,559 INFO L242 Difference]: Finished difference. Result has 225 places, 222 transitions, 455 flow [2022-04-18 16:36:24,560 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2022-04-18 16:36:24,562 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -32 predicate places. [2022-04-18 16:36:24,562 INFO L478 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 455 flow [2022-04-18 16:36:24,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:24,563 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:24,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 16:36:24,563 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 556067529, now seen corresponding path program 1 times [2022-04-18 16:36:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:24,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675235764] [2022-04-18 16:36:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:24,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675235764] [2022-04-18 16:36:24,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675235764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:24,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:24,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609854585] [2022-04-18 16:36:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:24,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:24,641 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-04-18 16:36:24,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:24,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-04-18 16:36:24,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:24,764 INFO L129 PetriNetUnfolder]: 113/713 cut-off events. [2022-04-18 16:36:24,764 INFO L130 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-04-18 16:36:24,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 713 events. 113/713 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3496 event pairs, 12 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 878. Up to 147 conditions per place. [2022-04-18 16:36:24,771 INFO L132 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-04-18 16:36:24,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 230 transitions, 522 flow [2022-04-18 16:36:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-04-18 16:36:24,773 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2022-04-18 16:36:24,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-04-18 16:36:24,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-04-18 16:36:24,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:24,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-04-18 16:36:24,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,779 INFO L186 Difference]: Start difference. First operand has 225 places, 222 transitions, 455 flow. Second operand 3 states and 768 transitions. [2022-04-18 16:36:24,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 230 transitions, 522 flow [2022-04-18 16:36:24,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 230 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:24,784 INFO L242 Difference]: Finished difference. Result has 223 places, 223 transitions, 463 flow [2022-04-18 16:36:24,785 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2022-04-18 16:36:24,786 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2022-04-18 16:36:24,786 INFO L478 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 463 flow [2022-04-18 16:36:24,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,789 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:24,790 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:24,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 16:36:24,790 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash 69936621, now seen corresponding path program 1 times [2022-04-18 16:36:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:24,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002247482] [2022-04-18 16:36:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:24,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:24,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002247482] [2022-04-18 16:36:24,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002247482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:24,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:24,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 16:36:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273372984] [2022-04-18 16:36:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:24,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 16:36:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 16:36:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-18 16:36:24,903 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 285 [2022-04-18 16:36:24,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:24,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:24,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 285 [2022-04-18 16:36:24,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:25,792 INFO L129 PetriNetUnfolder]: 1939/5317 cut-off events. [2022-04-18 16:36:25,792 INFO L130 PetriNetUnfolder]: For 280/386 co-relation queries the response was YES. [2022-04-18 16:36:25,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 5317 events. 1939/5317 cut-off events. For 280/386 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43772 event pairs, 1024 based on Foata normal form. 1/4346 useless extension candidates. Maximal degree in co-relation 8514. Up to 1732 conditions per place. [2022-04-18 16:36:25,837 INFO L132 encePairwiseOnDemand]: 271/285 looper letters, 148 selfloop transitions, 18 changer transitions 0/326 dead transitions. [2022-04-18 16:36:25,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 326 transitions, 1037 flow [2022-04-18 16:36:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 16:36:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-04-18 16:36:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2352 transitions. [2022-04-18 16:36:25,843 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7502392344497608 [2022-04-18 16:36:25,843 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2352 transitions. [2022-04-18 16:36:25,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2352 transitions. [2022-04-18 16:36:25,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:25,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2352 transitions. [2022-04-18 16:36:25,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 213.8181818181818) internal successors, (2352), 11 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,854 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,854 INFO L186 Difference]: Start difference. First operand has 223 places, 223 transitions, 463 flow. Second operand 11 states and 2352 transitions. [2022-04-18 16:36:25,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 326 transitions, 1037 flow [2022-04-18 16:36:25,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 326 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:25,860 INFO L242 Difference]: Finished difference. Result has 237 places, 233 transitions, 549 flow [2022-04-18 16:36:25,860 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2022-04-18 16:36:25,861 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2022-04-18 16:36:25,861 INFO L478 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 549 flow [2022-04-18 16:36:25,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,862 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:25,862 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:25,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 16:36:25,863 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1505767668, now seen corresponding path program 1 times [2022-04-18 16:36:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:25,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052978115] [2022-04-18 16:36:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:25,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052978115] [2022-04-18 16:36:25,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052978115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:25,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:25,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542170826] [2022-04-18 16:36:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:25,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:25,955 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-04-18 16:36:25,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:25,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:25,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-04-18 16:36:25,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:27,126 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 87#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-04-18 16:36:27,127 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-04-18 16:36:27,127 INFO L387 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-04-18 16:36:27,127 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:27,127 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:27,190 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 67#L97-4true, Black: 309#true, 340#true]) [2022-04-18 16:36:27,191 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-04-18 16:36:27,191 INFO L387 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-04-18 16:36:27,191 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:27,191 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:27,216 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 87#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 272#L75true]) [2022-04-18 16:36:27,217 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-04-18 16:36:27,217 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:27,217 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:27,217 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:27,217 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 183#L98-5true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 272#L75true]) [2022-04-18 16:36:27,218 INFO L384 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-04-18 16:36:27,218 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:27,218 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:27,218 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:27,218 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 208#L98-4true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 272#L75true]) [2022-04-18 16:36:27,219 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:27,219 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:27,219 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:27,219 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:27,219 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), 146#L98-1true, Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 272#L75true]) [2022-04-18 16:36:27,219 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-04-18 16:36:27,220 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:27,220 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:27,220 INFO L387 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-04-18 16:36:27,220 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 95#L98-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 272#L75true]) [2022-04-18 16:36:27,220 INFO L384 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-04-18 16:36:27,221 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-04-18 16:36:27,221 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:27,221 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:27,221 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 272#L75true, 212#L98-2true]) [2022-04-18 16:36:27,221 INFO L384 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-04-18 16:36:27,221 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:27,222 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-04-18 16:36:27,222 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:27,231 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 183#L98-5true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-04-18 16:36:27,232 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-04-18 16:36:27,232 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-04-18 16:36:27,232 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:27,232 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-04-18 16:36:27,232 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 87#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-04-18 16:36:27,232 INFO L384 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-04-18 16:36:27,233 INFO L387 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-04-18 16:36:27,233 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:27,233 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-04-18 16:36:27,233 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-04-18 16:36:27,233 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 208#L98-4true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-04-18 16:36:27,233 INFO L384 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-04-18 16:36:27,234 INFO L387 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-04-18 16:36:27,234 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-04-18 16:36:27,234 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:27,234 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 311#(= |#race~A~0| 0), 146#L98-1true, Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-04-18 16:36:27,234 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:27,234 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-04-18 16:36:27,235 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:27,235 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:36:27,235 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 95#L98-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-04-18 16:36:27,235 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-04-18 16:36:27,235 INFO L387 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-04-18 16:36:27,235 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:27,236 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-04-18 16:36:27,236 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 174#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 212#L98-2true]) [2022-04-18 16:36:27,236 INFO L384 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-04-18 16:36:27,236 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-04-18 16:36:27,236 INFO L387 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-04-18 16:36:27,237 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:27,248 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 183#L98-5true, Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 163#L79true]) [2022-04-18 16:36:27,249 INFO L384 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-04-18 16:36:27,249 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:27,249 INFO L387 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-04-18 16:36:27,249 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-04-18 16:36:27,249 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 87#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 163#L79true]) [2022-04-18 16:36:27,250 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-04-18 16:36:27,250 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:27,250 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-04-18 16:36:27,250 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-04-18 16:36:27,250 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 208#L98-4true, Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 163#L79true]) [2022-04-18 16:36:27,250 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-04-18 16:36:27,251 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:27,251 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:27,251 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-04-18 16:36:27,251 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), 146#L98-1true, Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 163#L79true]) [2022-04-18 16:36:27,251 INFO L384 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-04-18 16:36:27,251 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:27,252 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-04-18 16:36:27,252 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-04-18 16:36:27,252 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 95#L98-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 163#L79true]) [2022-04-18 16:36:27,252 INFO L384 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-04-18 16:36:27,252 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-04-18 16:36:27,253 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:27,253 INFO L387 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-04-18 16:36:27,253 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true, 163#L79true, 212#L98-2true]) [2022-04-18 16:36:27,253 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-04-18 16:36:27,253 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:27,253 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-04-18 16:36:27,253 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-04-18 16:36:27,262 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 67#L97-4true, Black: 309#true, 340#true, 272#L75true]) [2022-04-18 16:36:27,262 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-04-18 16:36:27,262 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-04-18 16:36:27,262 INFO L387 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-04-18 16:36:27,262 INFO L387 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-04-18 16:36:27,280 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 59#L61true, 266#L51-3true, 311#(= |#race~A~0| 0), Black: 326#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 324#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 334#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 67#L97-4true, Black: 309#true, 340#true, 163#L79true]) [2022-04-18 16:36:27,280 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-04-18 16:36:27,280 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-04-18 16:36:27,280 INFO L387 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-04-18 16:36:27,281 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-04-18 16:36:27,319 INFO L129 PetriNetUnfolder]: 3007/7208 cut-off events. [2022-04-18 16:36:27,319 INFO L130 PetriNetUnfolder]: For 994/1039 co-relation queries the response was YES. [2022-04-18 16:36:27,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12995 conditions, 7208 events. 3007/7208 cut-off events. For 994/1039 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 59330 event pairs, 899 based on Foata normal form. 36/6531 useless extension candidates. Maximal degree in co-relation 12953. Up to 2638 conditions per place. [2022-04-18 16:36:27,421 INFO L132 encePairwiseOnDemand]: 278/285 looper letters, 99 selfloop transitions, 13 changer transitions 0/296 dead transitions. [2022-04-18 16:36:27,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 296 transitions, 922 flow [2022-04-18 16:36:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1380 transitions. [2022-04-18 16:36:27,426 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2022-04-18 16:36:27,426 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1380 transitions. [2022-04-18 16:36:27,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1380 transitions. [2022-04-18 16:36:27,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:27,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1380 transitions. [2022-04-18 16:36:27,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:27,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:27,434 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:27,434 INFO L186 Difference]: Start difference. First operand has 237 places, 233 transitions, 549 flow. Second operand 6 states and 1380 transitions. [2022-04-18 16:36:27,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 296 transitions, 922 flow [2022-04-18 16:36:27,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 296 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:27,442 INFO L242 Difference]: Finished difference. Result has 245 places, 245 transitions, 654 flow [2022-04-18 16:36:27,442 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=245, PETRI_TRANSITIONS=245} [2022-04-18 16:36:27,443 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, -12 predicate places. [2022-04-18 16:36:27,443 INFO L478 AbstractCegarLoop]: Abstraction has has 245 places, 245 transitions, 654 flow [2022-04-18 16:36:27,444 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:27,444 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:27,444 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:27,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 16:36:27,445 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash -528629923, now seen corresponding path program 1 times [2022-04-18 16:36:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:27,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339867358] [2022-04-18 16:36:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:27,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339867358] [2022-04-18 16:36:27,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339867358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:27,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:27,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 16:36:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411918664] [2022-04-18 16:36:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:27,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 16:36:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 16:36:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-18 16:36:27,531 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 285 [2022-04-18 16:36:27,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 245 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:27,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:27,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 285 [2022-04-18 16:36:27,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:28,596 INFO L129 PetriNetUnfolder]: 2622/5781 cut-off events. [2022-04-18 16:36:28,596 INFO L130 PetriNetUnfolder]: For 2974/3668 co-relation queries the response was YES. [2022-04-18 16:36:28,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 5781 events. 2622/5781 cut-off events. For 2974/3668 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 44187 event pairs, 1283 based on Foata normal form. 40/4693 useless extension candidates. Maximal degree in co-relation 11632. Up to 3250 conditions per place. [2022-04-18 16:36:28,652 INFO L132 encePairwiseOnDemand]: 271/285 looper letters, 133 selfloop transitions, 18 changer transitions 0/324 dead transitions. [2022-04-18 16:36:28,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 324 transitions, 1138 flow [2022-04-18 16:36:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 16:36:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-04-18 16:36:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2410 transitions. [2022-04-18 16:36:28,658 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7687400318979266 [2022-04-18 16:36:28,658 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2410 transitions. [2022-04-18 16:36:28,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2410 transitions. [2022-04-18 16:36:28,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:28,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2410 transitions. [2022-04-18 16:36:28,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 219.0909090909091) internal successors, (2410), 11 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,671 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,671 INFO L186 Difference]: Start difference. First operand has 245 places, 245 transitions, 654 flow. Second operand 11 states and 2410 transitions. [2022-04-18 16:36:28,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 324 transitions, 1138 flow [2022-04-18 16:36:28,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 324 transitions, 1138 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:28,680 INFO L242 Difference]: Finished difference. Result has 257 places, 247 transitions, 702 flow [2022-04-18 16:36:28,680 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=702, PETRI_PLACES=257, PETRI_TRANSITIONS=247} [2022-04-18 16:36:28,681 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 0 predicate places. [2022-04-18 16:36:28,681 INFO L478 AbstractCegarLoop]: Abstraction has has 257 places, 247 transitions, 702 flow [2022-04-18 16:36:28,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:28,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:28,682 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:28,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 16:36:28,683 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:28,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash 558123374, now seen corresponding path program 1 times [2022-04-18 16:36:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:28,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723855901] [2022-04-18 16:36:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723855901] [2022-04-18 16:36:28,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723855901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:28,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:28,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929052511] [2022-04-18 16:36:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:28,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:28,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:28,807 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-04-18 16:36:28,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 247 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 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) [2022-04-18 16:36:28,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:28,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-04-18 16:36:28,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:29,950 INFO L129 PetriNetUnfolder]: 2201/6871 cut-off events. [2022-04-18 16:36:29,951 INFO L130 PetriNetUnfolder]: For 3758/3788 co-relation queries the response was YES. [2022-04-18 16:36:29,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13361 conditions, 6871 events. 2201/6871 cut-off events. For 3758/3788 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 66774 event pairs, 1289 based on Foata normal form. 24/6564 useless extension candidates. Maximal degree in co-relation 13312. Up to 2846 conditions per place. [2022-04-18 16:36:30,008 INFO L132 encePairwiseOnDemand]: 278/285 looper letters, 80 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2022-04-18 16:36:30,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 283 transitions, 1038 flow [2022-04-18 16:36:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1349 transitions. [2022-04-18 16:36:30,013 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2022-04-18 16:36:30,013 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1349 transitions. [2022-04-18 16:36:30,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1349 transitions. [2022-04-18 16:36:30,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:30,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1349 transitions. [2022-04-18 16:36:30,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:30,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:30,020 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:30,020 INFO L186 Difference]: Start difference. First operand has 257 places, 247 transitions, 702 flow. Second operand 6 states and 1349 transitions. [2022-04-18 16:36:30,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 283 transitions, 1038 flow [2022-04-18 16:36:30,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 283 transitions, 1021 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:30,040 INFO L242 Difference]: Finished difference. Result has 262 places, 263 transitions, 869 flow [2022-04-18 16:36:30,040 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=262, PETRI_TRANSITIONS=263} [2022-04-18 16:36:30,041 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 5 predicate places. [2022-04-18 16:36:30,041 INFO L478 AbstractCegarLoop]: Abstraction has has 262 places, 263 transitions, 869 flow [2022-04-18 16:36:30,042 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 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) [2022-04-18 16:36:30,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:30,042 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:30,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 16:36:30,042 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2126054492, now seen corresponding path program 1 times [2022-04-18 16:36:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:30,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787556275] [2022-04-18 16:36:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 16:36:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:30,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787556275] [2022-04-18 16:36:30,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787556275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:30,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:30,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037293592] [2022-04-18 16:36:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:30,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:30,161 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 285 [2022-04-18 16:36:30,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 263 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:30,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:30,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 285 [2022-04-18 16:36:30,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:32,251 INFO L129 PetriNetUnfolder]: 4882/12923 cut-off events. [2022-04-18 16:36:32,251 INFO L130 PetriNetUnfolder]: For 11447/11447 co-relation queries the response was YES. [2022-04-18 16:36:32,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28061 conditions, 12923 events. 4882/12923 cut-off events. For 11447/11447 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 132226 event pairs, 1972 based on Foata normal form. 0/12545 useless extension candidates. Maximal degree in co-relation 28011. Up to 5365 conditions per place. [2022-04-18 16:36:32,347 INFO L132 encePairwiseOnDemand]: 277/285 looper letters, 143 selfloop transitions, 26 changer transitions 0/349 dead transitions. [2022-04-18 16:36:32,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 349 transitions, 1635 flow [2022-04-18 16:36:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1367 transitions. [2022-04-18 16:36:32,350 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7994152046783626 [2022-04-18 16:36:32,350 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1367 transitions. [2022-04-18 16:36:32,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1367 transitions. [2022-04-18 16:36:32,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:32,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1367 transitions. [2022-04-18 16:36:32,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:32,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:32,357 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:32,357 INFO L186 Difference]: Start difference. First operand has 262 places, 263 transitions, 869 flow. Second operand 6 states and 1367 transitions. [2022-04-18 16:36:32,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 349 transitions, 1635 flow [2022-04-18 16:36:32,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 349 transitions, 1635 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:32,434 INFO L242 Difference]: Finished difference. Result has 272 places, 288 transitions, 1173 flow [2022-04-18 16:36:32,435 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=272, PETRI_TRANSITIONS=288} [2022-04-18 16:36:32,437 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 15 predicate places. [2022-04-18 16:36:32,437 INFO L478 AbstractCegarLoop]: Abstraction has has 272 places, 288 transitions, 1173 flow [2022-04-18 16:36:32,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:32,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:32,438 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:32,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 16:36:32,438 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1237774503, now seen corresponding path program 1 times [2022-04-18 16:36:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:32,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541193790] [2022-04-18 16:36:32,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 16:36:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:32,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541193790] [2022-04-18 16:36:32,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541193790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:32,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:32,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:32,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142158237] [2022-04-18 16:36:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:32,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:32,500 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 285 [2022-04-18 16:36:32,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 288 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:32,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:32,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 285 [2022-04-18 16:36:32,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:33,339 INFO L129 PetriNetUnfolder]: 2145/6631 cut-off events. [2022-04-18 16:36:33,339 INFO L130 PetriNetUnfolder]: For 16784/17131 co-relation queries the response was YES. [2022-04-18 16:36:33,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 6631 events. 2145/6631 cut-off events. For 16784/17131 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 63957 event pairs, 664 based on Foata normal form. 0/6366 useless extension candidates. Maximal degree in co-relation 16488. Up to 2137 conditions per place. [2022-04-18 16:36:33,398 INFO L132 encePairwiseOnDemand]: 282/285 looper letters, 70 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-04-18 16:36:33,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 302 transitions, 1441 flow [2022-04-18 16:36:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2022-04-18 16:36:33,400 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.87953216374269 [2022-04-18 16:36:33,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2022-04-18 16:36:33,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2022-04-18 16:36:33,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:33,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2022-04-18 16:36:33,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:33,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:33,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:33,404 INFO L186 Difference]: Start difference. First operand has 272 places, 288 transitions, 1173 flow. Second operand 3 states and 752 transitions. [2022-04-18 16:36:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 302 transitions, 1441 flow [2022-04-18 16:36:33,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 302 transitions, 1371 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:33,449 INFO L242 Difference]: Finished difference. Result has 273 places, 287 transitions, 1119 flow [2022-04-18 16:36:33,449 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=273, PETRI_TRANSITIONS=287} [2022-04-18 16:36:33,450 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 16 predicate places. [2022-04-18 16:36:33,450 INFO L478 AbstractCegarLoop]: Abstraction has has 273 places, 287 transitions, 1119 flow [2022-04-18 16:36:33,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:33,450 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:33,450 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:33,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 16:36:33,451 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1866306840, now seen corresponding path program 1 times [2022-04-18 16:36:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:33,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533783305] [2022-04-18 16:36:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533783305] [2022-04-18 16:36:33,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533783305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:33,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:33,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721512068] [2022-04-18 16:36:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:33,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:33,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:33,548 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-04-18 16:36:33,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 287 transitions, 1119 flow. Second operand has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:33,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:33,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-04-18 16:36:33,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:34,927 INFO L129 PetriNetUnfolder]: 3208/9688 cut-off events. [2022-04-18 16:36:34,928 INFO L130 PetriNetUnfolder]: For 11422/12194 co-relation queries the response was YES. [2022-04-18 16:36:35,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22046 conditions, 9688 events. 3208/9688 cut-off events. For 11422/12194 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 101043 event pairs, 1752 based on Foata normal form. 0/9530 useless extension candidates. Maximal degree in co-relation 21989. Up to 4485 conditions per place. [2022-04-18 16:36:35,056 INFO L132 encePairwiseOnDemand]: 280/285 looper letters, 104 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-04-18 16:36:35,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 294 transitions, 1349 flow [2022-04-18 16:36:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2022-04-18 16:36:35,060 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.776608187134503 [2022-04-18 16:36:35,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1328 transitions. [2022-04-18 16:36:35,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1328 transitions. [2022-04-18 16:36:35,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:35,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1328 transitions. [2022-04-18 16:36:35,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.33333333333334) internal successors, (1328), 6 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:35,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:35,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:35,067 INFO L186 Difference]: Start difference. First operand has 273 places, 287 transitions, 1119 flow. Second operand 6 states and 1328 transitions. [2022-04-18 16:36:35,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 294 transitions, 1349 flow [2022-04-18 16:36:35,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 294 transitions, 1345 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:35,119 INFO L242 Difference]: Finished difference. Result has 275 places, 286 transitions, 1121 flow [2022-04-18 16:36:35,120 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1121, PETRI_PLACES=275, PETRI_TRANSITIONS=286} [2022-04-18 16:36:35,120 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 18 predicate places. [2022-04-18 16:36:35,120 INFO L478 AbstractCegarLoop]: Abstraction has has 275 places, 286 transitions, 1121 flow [2022-04-18 16:36:35,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:35,121 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:35,121 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:35,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 16:36:35,121 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1709716499, now seen corresponding path program 1 times [2022-04-18 16:36:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:35,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934431087] [2022-04-18 16:36:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:35,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 16:36:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:35,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934431087] [2022-04-18 16:36:35,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934431087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:35,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:35,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-18 16:36:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995115999] [2022-04-18 16:36:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:35,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-18 16:36:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-18 16:36:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-18 16:36:35,376 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-04-18 16:36:35,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 286 transitions, 1121 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:35,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:35,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-04-18 16:36:35,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:45,980 INFO L129 PetriNetUnfolder]: 40337/70492 cut-off events. [2022-04-18 16:36:45,980 INFO L130 PetriNetUnfolder]: For 59794/59833 co-relation queries the response was YES. [2022-04-18 16:36:46,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180425 conditions, 70492 events. 40337/70492 cut-off events. For 59794/59833 co-relation queries the response was YES. Maximal size of possible extension queue 2337. Compared 670516 event pairs, 11295 based on Foata normal form. 333/69584 useless extension candidates. Maximal degree in co-relation 180361. Up to 15605 conditions per place. [2022-04-18 16:36:46,876 INFO L132 encePairwiseOnDemand]: 262/285 looper letters, 393 selfloop transitions, 70 changer transitions 0/607 dead transitions. [2022-04-18 16:36:46,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 607 transitions, 4099 flow [2022-04-18 16:36:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-18 16:36:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-04-18 16:36:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4272 transitions. [2022-04-18 16:36:46,886 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.6517162471395881 [2022-04-18 16:36:46,886 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4272 transitions. [2022-04-18 16:36:46,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4272 transitions. [2022-04-18 16:36:46,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:46,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4272 transitions. [2022-04-18 16:36:46,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 185.7391304347826) internal successors, (4272), 23 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:46,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:46,904 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:46,904 INFO L186 Difference]: Start difference. First operand has 275 places, 286 transitions, 1121 flow. Second operand 23 states and 4272 transitions. [2022-04-18 16:36:46,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 607 transitions, 4099 flow [2022-04-18 16:36:47,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 607 transitions, 4071 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:47,375 INFO L242 Difference]: Finished difference. Result has 298 places, 335 transitions, 1856 flow [2022-04-18 16:36:47,376 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1856, PETRI_PLACES=298, PETRI_TRANSITIONS=335} [2022-04-18 16:36:47,376 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 41 predicate places. [2022-04-18 16:36:47,376 INFO L478 AbstractCegarLoop]: Abstraction has has 298 places, 335 transitions, 1856 flow [2022-04-18 16:36:47,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:47,377 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:47,378 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:47,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 16:36:47,378 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:36:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash 212905121, now seen corresponding path program 2 times [2022-04-18 16:36:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:47,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972864530] [2022-04-18 16:36:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 16:36:47,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:47,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972864530] [2022-04-18 16:36:47,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972864530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:47,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:47,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-18 16:36:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711642601] [2022-04-18 16:36:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:47,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-18 16:36:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:47,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-18 16:36:47,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-18 16:36:47,596 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-04-18 16:36:47,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 335 transitions, 1856 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:47,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:47,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-04-18 16:36:47,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:37:04,102 INFO L129 PetriNetUnfolder]: 64442/110289 cut-off events. [2022-04-18 16:37:04,102 INFO L130 PetriNetUnfolder]: For 133445/133556 co-relation queries the response was YES. [2022-04-18 16:37:05,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 299671 conditions, 110289 events. 64442/110289 cut-off events. For 133445/133556 co-relation queries the response was YES. Maximal size of possible extension queue 3532. Compared 1081504 event pairs, 23908 based on Foata normal form. 333/107568 useless extension candidates. Maximal degree in co-relation 299602. Up to 39470 conditions per place. [2022-04-18 16:37:05,739 INFO L132 encePairwiseOnDemand]: 262/285 looper letters, 411 selfloop transitions, 90 changer transitions 0/645 dead transitions. [2022-04-18 16:37:05,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 645 transitions, 4985 flow [2022-04-18 16:37:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-18 16:37:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-04-18 16:37:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4273 transitions. [2022-04-18 16:37:05,749 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.6518688024408849 [2022-04-18 16:37:05,749 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4273 transitions. [2022-04-18 16:37:05,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4273 transitions. [2022-04-18 16:37:05,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:37:05,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4273 transitions. [2022-04-18 16:37:05,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 185.7826086956522) internal successors, (4273), 23 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:37:05,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:37:05,768 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:37:05,769 INFO L186 Difference]: Start difference. First operand has 298 places, 335 transitions, 1856 flow. Second operand 23 states and 4273 transitions. [2022-04-18 16:37:05,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 645 transitions, 4985 flow [2022-04-18 16:37:07,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 645 transitions, 4950 flow, removed 1 selfloop flow, removed 16 redundant places. [2022-04-18 16:37:07,305 INFO L242 Difference]: Finished difference. Result has 309 places, 385 transitions, 2711 flow [2022-04-18 16:37:07,305 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2711, PETRI_PLACES=309, PETRI_TRANSITIONS=385} [2022-04-18 16:37:07,306 INFO L335 CegarLoopForPetriNet]: 257 programPoint places, 52 predicate places. [2022-04-18 16:37:07,306 INFO L478 AbstractCegarLoop]: Abstraction has has 309 places, 385 transitions, 2711 flow [2022-04-18 16:37:07,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:37:07,308 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:37:07,308 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:37:07,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 16:37:07,308 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-04-18 16:37:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:37:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1046403500, now seen corresponding path program 1 times [2022-04-18 16:37:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:37:07,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395051366] [2022-04-18 16:37:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:37:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:37:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:37:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 16:37:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:37:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395051366] [2022-04-18 16:37:07,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395051366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:37:07,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:37:07,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-18 16:37:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820161991] [2022-04-18 16:37:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:37:07,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-18 16:37:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:37:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-18 16:37:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-18 16:37:07,806 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 285 [2022-04-18 16:37:07,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 385 transitions, 2711 flow. Second operand has 18 states, 18 states have (on average 188.66666666666666) internal successors, (3396), 18 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:37:07,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:37:07,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 285 [2022-04-18 16:37:07,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand