./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.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-more-multiply-verify.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 b6872adb14a2dfa535a444bb6d903bd37f60f26cf718935f2927b47d5c5a6aaa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 16:35:56,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 16:35:56,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 16:35:56,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 16:35:56,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 16:35:56,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 16:35:56,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 16:35:56,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 16:35:56,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 16:35:56,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 16:35:56,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 16:35:56,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 16:35:56,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 16:35:56,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 16:35:56,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 16:35:56,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 16:35:56,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 16:35:56,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 16:35:56,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 16:35:56,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 16:35:56,105 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 16:35:56,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 16:35:56,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 16:35:56,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 16:35:56,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 16:35:56,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 16:35:56,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 16:35:56,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 16:35:56,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 16:35:56,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 16:35:56,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 16:35:56,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 16:35:56,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 16:35:56,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 16:35:56,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 16:35:56,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 16:35:56,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 16:35:56,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 16:35:56,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 16:35:56,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 16:35:56,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 16:35:56,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 16:35:56,130 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:35:56,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 16:35:56,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 16:35:56,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 16:35:56,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 16:35:56,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 16:35:56,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 16:35:56,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 16:35:56,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 16:35:56,166 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 16:35:56,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 16:35:56,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 16:35:56,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 16:35:56,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 16:35:56,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 16:35:56,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 16:35:56,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 16:35:56,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 16:35:56,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 16:35:56,169 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 16:35:56,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 16:35:56,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 16:35:56,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 16:35:56,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 16:35:56,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 16:35:56,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 16:35:56,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 16:35:56,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:35:56,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 16:35:56,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 16:35:56,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 16:35:56,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 16:35:56,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 16:35:56,173 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 16:35:56,173 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 16:35:56,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 16:35:56,174 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 -> b6872adb14a2dfa535a444bb6d903bd37f60f26cf718935f2927b47d5c5a6aaa [2022-04-18 16:35:56,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 16:35:56,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 16:35:56,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 16:35:56,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 16:35:56,419 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 16:35:56,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-04-18 16:35:56,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7ddbfe7/d397fca602b2448b975f24ce24a1f0ad/FLAG7045a9691 [2022-04-18 16:35:56,940 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 16:35:56,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-04-18 16:35:56,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7ddbfe7/d397fca602b2448b975f24ce24a1f0ad/FLAG7045a9691 [2022-04-18 16:35:56,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7ddbfe7/d397fca602b2448b975f24ce24a1f0ad [2022-04-18 16:35:56,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 16:35:56,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 16:35:56,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 16:35:56,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 16:35:56,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 16:35:56,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:35:56" (1/1) ... [2022-04-18 16:35:56,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478d0cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:56, skipping insertion in model container [2022-04-18 16:35:56,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:35:56" (1/1) ... [2022-04-18 16:35:56,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 16:35:56,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 16:35:57,196 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-more-multiply-verify.wvr.c[3042,3055] [2022-04-18 16:35:57,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:35:57,209 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 16:35:57,239 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-more-multiply-verify.wvr.c[3042,3055] [2022-04-18 16:35:57,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:35:57,253 INFO L208 MainTranslator]: Completed translation [2022-04-18 16:35:57,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57 WrapperNode [2022-04-18 16:35:57,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 16:35:57,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 16:35:57,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 16:35:57,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 16:35:57,262 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:35:57" (1/1) ... [2022-04-18 16:35:57,272 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:35:57" (1/1) ... [2022-04-18 16:35:57,305 INFO L137 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 325 [2022-04-18 16:35:57,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 16:35:57,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 16:35:57,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 16:35:57,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 16:35:57,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 16:35:57,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 16:35:57,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 16:35:57,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 16:35:57,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (1/1) ... [2022-04-18 16:35:57,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:35:57,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:35:57,418 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:35:57,445 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:35:57,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 16:35:57,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 16:35:57,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 16:35:57,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 16:35:57,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 16:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 16:35:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 16:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 16:35:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 16:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 16:35:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 16:35:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-04-18 16:35:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-04-18 16:35:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 16:35:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 16:35:57,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 16:35:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 16:35:57,477 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:35:57,555 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 16:35:57,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 16:35:58,134 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 16:35:58,365 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 16:35:58,366 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-18 16:35:58,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:35:58 BoogieIcfgContainer [2022-04-18 16:35:58,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 16:35:58,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 16:35:58,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 16:35:58,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 16:35:58,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 04:35:56" (1/3) ... [2022-04-18 16:35:58,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d485b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:35:58, skipping insertion in model container [2022-04-18 16:35:58,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:35:57" (2/3) ... [2022-04-18 16:35:58,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d485b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:35:58, skipping insertion in model container [2022-04-18 16:35:58,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:35:58" (3/3) ... [2022-04-18 16:35:58,378 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-04-18 16:35:58,386 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 16:35:58,386 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 16:35:58,387 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-04-18 16:35:58,387 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 16:35:58,493 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-04-18 16:35:58,551 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 16:35:58,557 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:35:58,557 INFO L341 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-04-18 16:35:58,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 277 places, 276 transitions, 576 flow [2022-04-18 16:35:58,681 INFO L129 PetriNetUnfolder]: 9/273 cut-off events. [2022-04-18 16:35:58,681 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-04-18 16:35:58,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 273 events. 9/273 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 346 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-04-18 16:35:58,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 276 transitions, 576 flow [2022-04-18 16:35:58,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 253 transitions, 524 flow [2022-04-18 16:35:58,702 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2022-04-18 16:35:58,703 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:35:58,703 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:58,704 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:35:58,705 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:35:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2029531585, now seen corresponding path program 1 times [2022-04-18 16:35:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:58,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539632968] [2022-04-18 16:35:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:58,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:58,927 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:35:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:58,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539632968] [2022-04-18 16:35:58,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539632968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:58,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:58,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322719095] [2022-04-18 16:35:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:58,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:58,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:58,977 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-04-18 16:35:58,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 253 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:58,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:58,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-04-18 16:35:58,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:59,438 INFO L129 PetriNetUnfolder]: 207/2157 cut-off events. [2022-04-18 16:35:59,439 INFO L130 PetriNetUnfolder]: For 88/122 co-relation queries the response was YES. [2022-04-18 16:35:59,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 2157 events. 207/2157 cut-off events. For 88/122 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 18847 event pairs, 167 based on Foata normal form. 3/1767 useless extension candidates. Maximal degree in co-relation 2368. Up to 337 conditions per place. [2022-04-18 16:35:59,460 INFO L132 encePairwiseOnDemand]: 245/276 looper letters, 20 selfloop transitions, 2 changer transitions 2/224 dead transitions. [2022-04-18 16:35:59,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 224 transitions, 510 flow [2022-04-18 16:35:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2022-04-18 16:35:59,480 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2022-04-18 16:35:59,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2022-04-18 16:35:59,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2022-04-18 16:35:59,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:59,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2022-04-18 16:35:59,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 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:35:59,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:59,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:59,506 INFO L186 Difference]: Start difference. First operand has 255 places, 253 transitions, 524 flow. Second operand 3 states and 720 transitions. [2022-04-18 16:35:59,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 224 transitions, 510 flow [2022-04-18 16:35:59,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 224 transitions, 498 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-04-18 16:35:59,517 INFO L242 Difference]: Finished difference. Result has 227 places, 222 transitions, 454 flow [2022-04-18 16:35:59,519 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=225, 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=454, PETRI_PLACES=227, PETRI_TRANSITIONS=222} [2022-04-18 16:35:59,523 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -28 predicate places. [2022-04-18 16:35:59,523 INFO L478 AbstractCegarLoop]: Abstraction has has 227 places, 222 transitions, 454 flow [2022-04-18 16:35:59,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:59,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:59,525 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] [2022-04-18 16:35:59,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 16:35:59,526 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:35:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -661938477, now seen corresponding path program 1 times [2022-04-18 16:35:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:59,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457976758] [2022-04-18 16:35:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:59,590 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:35:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:59,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457976758] [2022-04-18 16:35:59,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457976758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:59,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:59,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508662559] [2022-04-18 16:35:59,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:59,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:59,595 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-04-18 16:35:59,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 222 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:59,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:59,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-04-18 16:35:59,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:35:59,760 INFO L129 PetriNetUnfolder]: 75/833 cut-off events. [2022-04-18 16:35:59,761 INFO L130 PetriNetUnfolder]: For 9/17 co-relation queries the response was YES. [2022-04-18 16:35:59,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 833 events. 75/833 cut-off events. For 9/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4493 event pairs, 38 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 933. Up to 115 conditions per place. [2022-04-18 16:35:59,770 INFO L132 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2022-04-18 16:35:59,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 221 transitions, 484 flow [2022-04-18 16:35:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:35:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:35:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-04-18 16:35:59,773 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-04-18 16:35:59,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-04-18 16:35:59,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-04-18 16:35:59,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:35:59,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-04-18 16:35:59,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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:35:59,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:59,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:59,778 INFO L186 Difference]: Start difference. First operand has 227 places, 222 transitions, 454 flow. Second operand 3 states and 704 transitions. [2022-04-18 16:35:59,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 221 transitions, 484 flow [2022-04-18 16:35:59,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 221 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:35:59,789 INFO L242 Difference]: Finished difference. Result has 224 places, 221 transitions, 452 flow [2022-04-18 16:35:59,789 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=221} [2022-04-18 16:35:59,791 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-04-18 16:35:59,791 INFO L478 AbstractCegarLoop]: Abstraction has has 224 places, 221 transitions, 452 flow [2022-04-18 16:35:59,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:59,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:35:59,792 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] [2022-04-18 16:35:59,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 16:35:59,793 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:35:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:35:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1148521980, now seen corresponding path program 1 times [2022-04-18 16:35:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:35:59,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332903262] [2022-04-18 16:35:59,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:35:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:35:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:35:59,861 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:35:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:35:59,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332903262] [2022-04-18 16:35:59,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332903262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:35:59,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:35:59,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:35:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761048988] [2022-04-18 16:35:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:35:59,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:35:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:35:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:35:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:35:59,867 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-04-18 16:35:59,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 221 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:35:59,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:35:59,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-04-18 16:35:59,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:00,009 INFO L129 PetriNetUnfolder]: 75/832 cut-off events. [2022-04-18 16:36:00,010 INFO L130 PetriNetUnfolder]: For 9/17 co-relation queries the response was YES. [2022-04-18 16:36:00,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 832 events. 75/832 cut-off events. For 9/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4492 event pairs, 38 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 929. Up to 118 conditions per place. [2022-04-18 16:36:00,018 INFO L132 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2022-04-18 16:36:00,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 488 flow [2022-04-18 16:36:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2022-04-18 16:36:00,023 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2022-04-18 16:36:00,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2022-04-18 16:36:00,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2022-04-18 16:36:00,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:00,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2022-04-18 16:36:00,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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:00,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,028 INFO L186 Difference]: Start difference. First operand has 224 places, 221 transitions, 452 flow. Second operand 3 states and 698 transitions. [2022-04-18 16:36:00,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 488 flow [2022-04-18 16:36:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:00,034 INFO L242 Difference]: Finished difference. Result has 223 places, 220 transitions, 450 flow [2022-04-18 16:36:00,034 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=220} [2022-04-18 16:36:00,037 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -32 predicate places. [2022-04-18 16:36:00,037 INFO L478 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 450 flow [2022-04-18 16:36:00,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:00,038 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:00,038 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] [2022-04-18 16:36:00,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 16:36:00,039 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:00,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash -250869527, now seen corresponding path program 1 times [2022-04-18 16:36:00,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:00,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483642451] [2022-04-18 16:36:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:00,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:00,107 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:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:00,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483642451] [2022-04-18 16:36:00,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483642451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:00,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:00,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040677291] [2022-04-18 16:36:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:00,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:00,115 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 276 [2022-04-18 16:36:00,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 220 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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:00,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:00,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 276 [2022-04-18 16:36:00,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:00,305 INFO L129 PetriNetUnfolder]: 267/1023 cut-off events. [2022-04-18 16:36:00,305 INFO L130 PetriNetUnfolder]: For 33/44 co-relation queries the response was YES. [2022-04-18 16:36:00,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1023 events. 267/1023 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5755 event pairs, 146 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1383. Up to 388 conditions per place. [2022-04-18 16:36:00,314 INFO L132 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2022-04-18 16:36:00,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 498 flow [2022-04-18 16:36:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-04-18 16:36:00,318 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2022-04-18 16:36:00,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-04-18 16:36:00,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-04-18 16:36:00,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:00,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-04-18 16:36:00,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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:00,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,325 INFO L186 Difference]: Start difference. First operand has 223 places, 220 transitions, 450 flow. Second operand 3 states and 686 transitions. [2022-04-18 16:36:00,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 498 flow [2022-04-18 16:36:00,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:00,333 INFO L242 Difference]: Finished difference. Result has 222 places, 219 transitions, 448 flow [2022-04-18 16:36:00,334 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2022-04-18 16:36:00,336 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -33 predicate places. [2022-04-18 16:36:00,336 INFO L478 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 448 flow [2022-04-18 16:36:00,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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:00,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:00,337 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] [2022-04-18 16:36:00,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 16:36:00,337 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 165908282, now seen corresponding path program 1 times [2022-04-18 16:36:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:00,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630226874] [2022-04-18 16:36:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:00,396 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:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630226874] [2022-04-18 16:36:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630226874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:00,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:00,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134831516] [2022-04-18 16:36:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:00,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:00,400 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-04-18 16:36:00,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:00,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:00,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-04-18 16:36:00,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:00,545 INFO L129 PetriNetUnfolder]: 203/932 cut-off events. [2022-04-18 16:36:00,545 INFO L130 PetriNetUnfolder]: For 26/36 co-relation queries the response was YES. [2022-04-18 16:36:00,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 932 events. 203/932 cut-off events. For 26/36 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5036 event pairs, 110 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1190. Up to 293 conditions per place. [2022-04-18 16:36:00,554 INFO L132 encePairwiseOnDemand]: 272/276 looper letters, 18 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2022-04-18 16:36:00,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 480 flow [2022-04-18 16:36:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2022-04-18 16:36:00,557 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2022-04-18 16:36:00,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2022-04-18 16:36:00,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2022-04-18 16:36:00,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:00,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2022-04-18 16:36:00,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:00,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,561 INFO L186 Difference]: Start difference. First operand has 222 places, 219 transitions, 448 flow. Second operand 3 states and 691 transitions. [2022-04-18 16:36:00,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 480 flow [2022-04-18 16:36:00,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:00,566 INFO L242 Difference]: Finished difference. Result has 219 places, 216 transitions, 440 flow [2022-04-18 16:36:00,567 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=219, PETRI_TRANSITIONS=216} [2022-04-18 16:36:00,569 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-04-18 16:36:00,569 INFO L478 AbstractCegarLoop]: Abstraction has has 219 places, 216 transitions, 440 flow [2022-04-18 16:36:00,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:00,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:00,570 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] [2022-04-18 16:36:00,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 16:36:00,571 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1146374314, now seen corresponding path program 1 times [2022-04-18 16:36:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:00,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49183025] [2022-04-18 16:36:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:00,617 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:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49183025] [2022-04-18 16:36:00,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49183025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:00,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:00,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039698003] [2022-04-18 16:36:00,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:00,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:00,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:00,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:00,622 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-04-18 16:36:00,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:00,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:00,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-04-18 16:36:00,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:00,735 INFO L129 PetriNetUnfolder]: 75/803 cut-off events. [2022-04-18 16:36:00,736 INFO L130 PetriNetUnfolder]: For 9/17 co-relation queries the response was YES. [2022-04-18 16:36:00,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 803 events. 75/803 cut-off events. For 9/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4242 event pairs, 38 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 882. Up to 115 conditions per place. [2022-04-18 16:36:00,744 INFO L132 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-04-18 16:36:00,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 470 flow [2022-04-18 16:36:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-04-18 16:36:00,746 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-04-18 16:36:00,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-04-18 16:36:00,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-04-18 16:36:00,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:00,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-04-18 16:36:00,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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:00,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,750 INFO L186 Difference]: Start difference. First operand has 219 places, 216 transitions, 440 flow. Second operand 3 states and 704 transitions. [2022-04-18 16:36:00,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 470 flow [2022-04-18 16:36:00,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:00,755 INFO L242 Difference]: Finished difference. Result has 219 places, 215 transitions, 441 flow [2022-04-18 16:36:00,756 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2022-04-18 16:36:00,758 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-04-18 16:36:00,758 INFO L478 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 441 flow [2022-04-18 16:36:00,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:00,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:00,759 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] [2022-04-18 16:36:00,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 16:36:00,759 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1941991352, now seen corresponding path program 1 times [2022-04-18 16:36:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:00,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027020308] [2022-04-18 16:36:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:00,821 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:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:00,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027020308] [2022-04-18 16:36:00,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027020308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:00,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:00,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:00,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419361759] [2022-04-18 16:36:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:00,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:00,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:00,824 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-04-18 16:36:00,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:00,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:00,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-04-18 16:36:00,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:00,939 INFO L129 PetriNetUnfolder]: 75/802 cut-off events. [2022-04-18 16:36:00,940 INFO L130 PetriNetUnfolder]: For 9/17 co-relation queries the response was YES. [2022-04-18 16:36:00,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 802 events. 75/802 cut-off events. For 9/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4241 event pairs, 38 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 881. Up to 113 conditions per place. [2022-04-18 16:36:00,948 INFO L132 encePairwiseOnDemand]: 274/276 looper letters, 14 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2022-04-18 16:36:00,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 214 transitions, 469 flow [2022-04-18 16:36:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2022-04-18 16:36:00,950 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8490338164251208 [2022-04-18 16:36:00,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2022-04-18 16:36:00,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2022-04-18 16:36:00,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:00,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2022-04-18 16:36:00,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:00,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:00,955 INFO L186 Difference]: Start difference. First operand has 219 places, 215 transitions, 441 flow. Second operand 3 states and 703 transitions. [2022-04-18 16:36:00,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 214 transitions, 469 flow [2022-04-18 16:36:00,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:00,959 INFO L242 Difference]: Finished difference. Result has 218 places, 214 transitions, 437 flow [2022-04-18 16:36:00,960 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=218, PETRI_TRANSITIONS=214} [2022-04-18 16:36:00,961 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-04-18 16:36:00,961 INFO L478 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 437 flow [2022-04-18 16:36:00,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:00,961 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:00,961 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] [2022-04-18 16:36:00,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 16:36:00,962 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -685495310, now seen corresponding path program 1 times [2022-04-18 16:36:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:00,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455205130] [2022-04-18 16:36:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:01,029 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:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:01,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455205130] [2022-04-18 16:36:01,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455205130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:01,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:01,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465508506] [2022-04-18 16:36:01,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:01,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:01,033 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-04-18 16:36:01,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 214 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:01,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:01,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-04-18 16:36:01,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:01,185 INFO L129 PetriNetUnfolder]: 267/993 cut-off events. [2022-04-18 16:36:01,186 INFO L130 PetriNetUnfolder]: For 33/47 co-relation queries the response was YES. [2022-04-18 16:36:01,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 993 events. 267/993 cut-off events. For 33/47 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5421 event pairs, 146 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1343. Up to 385 conditions per place. [2022-04-18 16:36:01,196 INFO L132 encePairwiseOnDemand]: 273/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2022-04-18 16:36:01,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 479 flow [2022-04-18 16:36:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2022-04-18 16:36:01,199 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8357487922705314 [2022-04-18 16:36:01,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 692 transitions. [2022-04-18 16:36:01,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 692 transitions. [2022-04-18 16:36:01,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:01,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 692 transitions. [2022-04-18 16:36:01,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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:01,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:01,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:01,204 INFO L186 Difference]: Start difference. First operand has 218 places, 214 transitions, 437 flow. Second operand 3 states and 692 transitions. [2022-04-18 16:36:01,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 479 flow [2022-04-18 16:36:01,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:36:01,208 INFO L242 Difference]: Finished difference. Result has 218 places, 213 transitions, 438 flow [2022-04-18 16:36:01,209 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2022-04-18 16:36:01,210 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-04-18 16:36:01,210 INFO L478 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 438 flow [2022-04-18 16:36:01,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:01,211 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:01,211 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] [2022-04-18 16:36:01,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 16:36:01,211 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1258613492, now seen corresponding path program 1 times [2022-04-18 16:36:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:01,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100589106] [2022-04-18 16:36:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:01,338 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:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:01,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100589106] [2022-04-18 16:36:01,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100589106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:01,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:01,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659907533] [2022-04-18 16:36:01,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:01,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:01,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:01,342 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2022-04-18 16:36:01,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:01,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:01,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2022-04-18 16:36:01,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:02,492 INFO L129 PetriNetUnfolder]: 3825/6652 cut-off events. [2022-04-18 16:36:02,492 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-04-18 16:36:02,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11797 conditions, 6652 events. 3825/6652 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 43852 event pairs, 2444 based on Foata normal form. 0/5960 useless extension candidates. Maximal degree in co-relation 11744. Up to 5121 conditions per place. [2022-04-18 16:36:02,555 INFO L132 encePairwiseOnDemand]: 270/276 looper letters, 52 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2022-04-18 16:36:02,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 212 transitions, 550 flow [2022-04-18 16:36:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2022-04-18 16:36:02,558 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.716183574879227 [2022-04-18 16:36:02,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2022-04-18 16:36:02,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2022-04-18 16:36:02,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:02,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2022-04-18 16:36:02,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 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:02,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:02,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:02,565 INFO L186 Difference]: Start difference. First operand has 218 places, 213 transitions, 438 flow. Second operand 6 states and 1186 transitions. [2022-04-18 16:36:02,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 212 transitions, 550 flow [2022-04-18 16:36:02,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 212 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:02,570 INFO L242 Difference]: Finished difference. Result has 220 places, 212 transitions, 442 flow [2022-04-18 16:36:02,571 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=220, PETRI_TRANSITIONS=212} [2022-04-18 16:36:02,571 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -35 predicate places. [2022-04-18 16:36:02,572 INFO L478 AbstractCegarLoop]: Abstraction has has 220 places, 212 transitions, 442 flow [2022-04-18 16:36:02,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:02,572 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:02,573 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] [2022-04-18 16:36:02,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 16:36:02,573 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 515061523, now seen corresponding path program 1 times [2022-04-18 16:36:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:02,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706756862] [2022-04-18 16:36:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:02,604 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:02,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:02,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706756862] [2022-04-18 16:36:02,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706756862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:02,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:02,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232162481] [2022-04-18 16:36:02,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:02,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:02,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:02,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:02,608 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-04-18 16:36:02,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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:02,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:02,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-04-18 16:36:02,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:02,725 INFO L129 PetriNetUnfolder]: 148/591 cut-off events. [2022-04-18 16:36:02,725 INFO L130 PetriNetUnfolder]: For 13/37 co-relation queries the response was YES. [2022-04-18 16:36:02,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 591 events. 148/591 cut-off events. For 13/37 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2788 event pairs, 44 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 856. Up to 236 conditions per place. [2022-04-18 16:36:02,731 INFO L132 encePairwiseOnDemand]: 272/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-04-18 16:36:02,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 494 flow [2022-04-18 16:36:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-04-18 16:36:02,735 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-04-18 16:36:02,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-04-18 16:36:02,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-04-18 16:36:02,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:02,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-04-18 16:36:02,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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:02,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:02,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:02,740 INFO L186 Difference]: Start difference. First operand has 220 places, 212 transitions, 442 flow. Second operand 3 states and 702 transitions. [2022-04-18 16:36:02,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 494 flow [2022-04-18 16:36:02,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 484 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-04-18 16:36:02,745 INFO L242 Difference]: Finished difference. Result has 216 places, 212 transitions, 442 flow [2022-04-18 16:36:02,746 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=216, PETRI_TRANSITIONS=212} [2022-04-18 16:36:02,746 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -39 predicate places. [2022-04-18 16:36:02,747 INFO L478 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 442 flow [2022-04-18 16:36:02,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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:02,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:02,747 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] [2022-04-18 16:36:02,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 16:36:02,748 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1453097214, now seen corresponding path program 1 times [2022-04-18 16:36:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:02,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401021562] [2022-04-18 16:36:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:02,789 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:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:02,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401021562] [2022-04-18 16:36:02,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401021562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:02,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:02,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857369166] [2022-04-18 16:36:02,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:02,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:02,793 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-04-18 16:36:02,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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:02,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:02,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-04-18 16:36:02,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:02,962 INFO L129 PetriNetUnfolder]: 184/988 cut-off events. [2022-04-18 16:36:02,962 INFO L130 PetriNetUnfolder]: For 25/40 co-relation queries the response was YES. [2022-04-18 16:36:02,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 988 events. 184/988 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5880 event pairs, 39 based on Foata normal form. 1/889 useless extension candidates. Maximal degree in co-relation 1255. Up to 239 conditions per place. [2022-04-18 16:36:02,972 INFO L132 encePairwiseOnDemand]: 271/276 looper letters, 22 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2022-04-18 16:36:02,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2022-04-18 16:36:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-04-18 16:36:02,975 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-04-18 16:36:02,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-04-18 16:36:02,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-04-18 16:36:02,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:02,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-04-18 16:36:02,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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:02,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:02,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:02,980 INFO L186 Difference]: Start difference. First operand has 216 places, 212 transitions, 442 flow. Second operand 3 states and 705 transitions. [2022-04-18 16:36:02,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2022-04-18 16:36:02,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:02,985 INFO L242 Difference]: Finished difference. Result has 217 places, 213 transitions, 459 flow [2022-04-18 16:36:02,986 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2022-04-18 16:36:02,986 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -38 predicate places. [2022-04-18 16:36:02,987 INFO L478 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 459 flow [2022-04-18 16:36:02,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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:02,987 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:02,987 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:02,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 16:36:02,988 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1543022137, now seen corresponding path program 1 times [2022-04-18 16:36:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:02,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885163230] [2022-04-18 16:36:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:03,114 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:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:03,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885163230] [2022-04-18 16:36:03,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885163230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:03,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:03,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108900150] [2022-04-18 16:36:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:03,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:03,119 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-04-18 16:36:03,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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:03,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:03,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-04-18 16:36:03,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:04,334 INFO L129 PetriNetUnfolder]: 4175/6553 cut-off events. [2022-04-18 16:36:04,335 INFO L130 PetriNetUnfolder]: For 1489/1534 co-relation queries the response was YES. [2022-04-18 16:36:04,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13976 conditions, 6553 events. 4175/6553 cut-off events. For 1489/1534 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 43396 event pairs, 396 based on Foata normal form. 0/5754 useless extension candidates. Maximal degree in co-relation 13920. Up to 2555 conditions per place. [2022-04-18 16:36:04,404 INFO L132 encePairwiseOnDemand]: 271/276 looper letters, 123 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2022-04-18 16:36:04,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 288 transitions, 903 flow [2022-04-18 16:36:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1276 transitions. [2022-04-18 16:36:04,408 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7705314009661836 [2022-04-18 16:36:04,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1276 transitions. [2022-04-18 16:36:04,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1276 transitions. [2022-04-18 16:36:04,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:04,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1276 transitions. [2022-04-18 16:36:04,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.66666666666666) internal successors, (1276), 6 states have internal predecessors, (1276), 0 states have call successors, (0), 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:04,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:04,416 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:04,416 INFO L186 Difference]: Start difference. First operand has 217 places, 213 transitions, 459 flow. Second operand 6 states and 1276 transitions. [2022-04-18 16:36:04,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 288 transitions, 903 flow [2022-04-18 16:36:04,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 288 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:36:04,423 INFO L242 Difference]: Finished difference. Result has 221 places, 212 transitions, 465 flow [2022-04-18 16:36:04,424 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=221, PETRI_TRANSITIONS=212} [2022-04-18 16:36:04,424 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-04-18 16:36:04,425 INFO L478 AbstractCegarLoop]: Abstraction has has 221 places, 212 transitions, 465 flow [2022-04-18 16:36:04,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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:04,426 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:04,426 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] [2022-04-18 16:36:04,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 16:36:04,426 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1630701092, now seen corresponding path program 1 times [2022-04-18 16:36:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:04,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754073420] [2022-04-18 16:36:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:04,522 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:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:04,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754073420] [2022-04-18 16:36:04,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754073420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:04,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:04,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284311180] [2022-04-18 16:36:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:04,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:04,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:04,526 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-04-18 16:36:04,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 212 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 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:04,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:04,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-04-18 16:36:04,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:05,753 INFO L129 PetriNetUnfolder]: 3929/7118 cut-off events. [2022-04-18 16:36:05,753 INFO L130 PetriNetUnfolder]: For 2041/2085 co-relation queries the response was YES. [2022-04-18 16:36:05,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14790 conditions, 7118 events. 3929/7118 cut-off events. For 2041/2085 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 51399 event pairs, 487 based on Foata normal form. 4/6337 useless extension candidates. Maximal degree in co-relation 14732. Up to 3142 conditions per place. [2022-04-18 16:36:05,903 INFO L132 encePairwiseOnDemand]: 271/276 looper letters, 141 selfloop transitions, 4 changer transitions 0/303 dead transitions. [2022-04-18 16:36:05,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 303 transitions, 993 flow [2022-04-18 16:36:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1296 transitions. [2022-04-18 16:36:05,907 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2022-04-18 16:36:05,907 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1296 transitions. [2022-04-18 16:36:05,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1296 transitions. [2022-04-18 16:36:05,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:05,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1296 transitions. [2022-04-18 16:36:05,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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:05,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:05,914 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:05,914 INFO L186 Difference]: Start difference. First operand has 221 places, 212 transitions, 465 flow. Second operand 6 states and 1296 transitions. [2022-04-18 16:36:05,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 303 transitions, 993 flow [2022-04-18 16:36:05,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 303 transitions, 958 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:05,921 INFO L242 Difference]: Finished difference. Result has 221 places, 211 transitions, 464 flow [2022-04-18 16:36:05,922 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2022-04-18 16:36:05,922 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-04-18 16:36:05,923 INFO L478 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 464 flow [2022-04-18 16:36:05,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 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:05,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:05,924 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] [2022-04-18 16:36:05,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 16:36:05,924 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1959845868, now seen corresponding path program 1 times [2022-04-18 16:36:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:05,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4651831] [2022-04-18 16:36:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:06,030 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:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4651831] [2022-04-18 16:36:06,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4651831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:06,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:06,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006874619] [2022-04-18 16:36:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:06,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:06,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:06,034 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-04-18 16:36:06,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 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:06,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:06,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-04-18 16:36:06,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:07,260 INFO L129 PetriNetUnfolder]: 3674/6705 cut-off events. [2022-04-18 16:36:07,260 INFO L130 PetriNetUnfolder]: For 1510/1554 co-relation queries the response was YES. [2022-04-18 16:36:07,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13806 conditions, 6705 events. 3674/6705 cut-off events. For 1510/1554 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 47670 event pairs, 1357 based on Foata normal form. 0/6031 useless extension candidates. Maximal degree in co-relation 13748. Up to 3305 conditions per place. [2022-04-18 16:36:07,327 INFO L132 encePairwiseOnDemand]: 271/276 looper letters, 140 selfloop transitions, 4 changer transitions 0/302 dead transitions. [2022-04-18 16:36:07,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 302 transitions, 962 flow [2022-04-18 16:36:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2022-04-18 16:36:07,331 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7820048309178744 [2022-04-18 16:36:07,331 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1295 transitions. [2022-04-18 16:36:07,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1295 transitions. [2022-04-18 16:36:07,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:07,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1295 transitions. [2022-04-18 16:36:07,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 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:07,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:07,338 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:07,338 INFO L186 Difference]: Start difference. First operand has 221 places, 211 transitions, 464 flow. Second operand 6 states and 1295 transitions. [2022-04-18 16:36:07,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 302 transitions, 962 flow [2022-04-18 16:36:07,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 302 transitions, 955 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:07,346 INFO L242 Difference]: Finished difference. Result has 221 places, 210 transitions, 463 flow [2022-04-18 16:36:07,347 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=221, PETRI_TRANSITIONS=210} [2022-04-18 16:36:07,347 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-04-18 16:36:07,347 INFO L478 AbstractCegarLoop]: Abstraction has has 221 places, 210 transitions, 463 flow [2022-04-18 16:36:07,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 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:07,348 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:07,349 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] [2022-04-18 16:36:07,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 16:36:07,349 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1375283311, now seen corresponding path program 1 times [2022-04-18 16:36:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:07,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266267864] [2022-04-18 16:36:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:07,420 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:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:07,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266267864] [2022-04-18 16:36:07,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266267864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:07,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:07,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-18 16:36:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338590191] [2022-04-18 16:36:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:07,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:07,424 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 276 [2022-04-18 16:36:07,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 210 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 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:07,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:07,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 276 [2022-04-18 16:36:07,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:07,600 INFO L129 PetriNetUnfolder]: 118/959 cut-off events. [2022-04-18 16:36:07,600 INFO L130 PetriNetUnfolder]: For 73/93 co-relation queries the response was YES. [2022-04-18 16:36:07,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 959 events. 118/959 cut-off events. For 73/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5101 event pairs, 50 based on Foata normal form. 19/912 useless extension candidates. Maximal degree in co-relation 1324. Up to 142 conditions per place. [2022-04-18 16:36:07,609 INFO L132 encePairwiseOnDemand]: 266/276 looper letters, 35 selfloop transitions, 6 changer transitions 6/225 dead transitions. [2022-04-18 16:36:07,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 590 flow [2022-04-18 16:36:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 16:36:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-04-18 16:36:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1553 transitions. [2022-04-18 16:36:07,613 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8038302277432712 [2022-04-18 16:36:07,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1553 transitions. [2022-04-18 16:36:07,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1553 transitions. [2022-04-18 16:36:07,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:07,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1553 transitions. [2022-04-18 16:36:07,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.85714285714286) internal successors, (1553), 7 states have internal predecessors, (1553), 0 states have call successors, (0), 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:07,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 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:07,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 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:07,621 INFO L186 Difference]: Start difference. First operand has 221 places, 210 transitions, 463 flow. Second operand 7 states and 1553 transitions. [2022-04-18 16:36:07,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 590 flow [2022-04-18 16:36:07,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 225 transitions, 583 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:07,626 INFO L242 Difference]: Finished difference. Result has 225 places, 211 transitions, 482 flow [2022-04-18 16:36:07,626 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=225, PETRI_TRANSITIONS=211} [2022-04-18 16:36:07,627 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -30 predicate places. [2022-04-18 16:36:07,627 INFO L478 AbstractCegarLoop]: Abstraction has has 225 places, 211 transitions, 482 flow [2022-04-18 16:36:07,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 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:07,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:07,628 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:07,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 16:36:07,628 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash -888664928, now seen corresponding path program 1 times [2022-04-18 16:36:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:07,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093288121] [2022-04-18 16:36:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 16:36:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:07,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093288121] [2022-04-18 16:36:07,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093288121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:07,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:07,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600955424] [2022-04-18 16:36:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:07,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:07,721 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-04-18 16:36:07,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 211 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:07,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:07,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-04-18 16:36:07,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:08,013 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 365#true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L60true, 216#L76true, 333#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 232#L86true]) [2022-04-18 16:36:08,013 INFO L384 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-04-18 16:36:08,013 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 16:36:08,014 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-04-18 16:36:08,014 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-04-18 16:36:08,014 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 365#true, 332#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 126#L60true, 232#L86true]) [2022-04-18 16:36:08,014 INFO L384 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-04-18 16:36:08,015 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:08,015 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-04-18 16:36:08,015 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:36:08,015 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 224#L105-5true, Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 365#true, 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 126#L60true, 232#L86true]) [2022-04-18 16:36:08,016 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-04-18 16:36:08,016 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:36:08,016 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 16:36:08,016 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 16:36:08,041 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 10#L105-6true, 365#true, 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L60true, 216#L76true, 232#L86true]) [2022-04-18 16:36:08,041 INFO L384 tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event [2022-04-18 16:36:08,041 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-04-18 16:36:08,042 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-04-18 16:36:08,042 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-04-18 16:36:08,121 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 253#L105-7true, 365#true, 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 232#L86true]) [2022-04-18 16:36:08,121 INFO L384 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,122 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,122 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:36:08,122 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:36:08,178 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 365#true, 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 103#L106-1true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 232#L86true]) [2022-04-18 16:36:08,178 INFO L384 tUnfolder$Statistics]: this new event has 152 ancestors and is cut-off event [2022-04-18 16:36:08,178 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-04-18 16:36:08,179 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-04-18 16:36:08,179 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-04-18 16:36:08,214 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][184], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 367#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 216#L76true, 55#L106-2true, 232#L86true]) [2022-04-18 16:36:08,215 INFO L384 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-04-18 16:36:08,215 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-04-18 16:36:08,215 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:36:08,215 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:36:08,249 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), 368#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 8#L106-3true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 232#L86true]) [2022-04-18 16:36:08,250 INFO L384 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-04-18 16:36:08,250 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-04-18 16:36:08,250 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-04-18 16:36:08,250 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-04-18 16:36:08,336 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][197], [326#(= |#race~queue~0| 0), 369#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 124#L106-4true, 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 232#L86true]) [2022-04-18 16:36:08,337 INFO L384 tUnfolder$Statistics]: this new event has 155 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:36:08,337 INFO L387 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-04-18 16:36:08,371 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][203], [326#(= |#race~queue~0| 0), Black: 319#true, 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 298#(= |#race~start~0| 0), Black: 324#true, 131#L106-5true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 232#L86true]) [2022-04-18 16:36:08,371 INFO L384 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-04-18 16:36:08,372 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:36:08,372 INFO L387 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-04-18 16:36:08,372 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:36:08,393 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][203], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 51#L106-6true, 334#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 216#L76true, 232#L86true]) [2022-04-18 16:36:08,393 INFO L384 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-04-18 16:36:08,393 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-04-18 16:36:08,394 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,394 INFO L387 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-04-18 16:36:08,660 INFO L129 PetriNetUnfolder]: 3031/5729 cut-off events. [2022-04-18 16:36:08,660 INFO L130 PetriNetUnfolder]: For 1360/1436 co-relation queries the response was YES. [2022-04-18 16:36:08,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11748 conditions, 5729 events. 3031/5729 cut-off events. For 1360/1436 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 41280 event pairs, 1424 based on Foata normal form. 0/5303 useless extension candidates. Maximal degree in co-relation 11687. Up to 3409 conditions per place. [2022-04-18 16:36:08,710 INFO L132 encePairwiseOnDemand]: 271/276 looper letters, 96 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2022-04-18 16:36:08,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 262 transitions, 808 flow [2022-04-18 16:36:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-04-18 16:36:08,714 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7590579710144928 [2022-04-18 16:36:08,715 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-04-18 16:36:08,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-04-18 16:36:08,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:08,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-04-18 16:36:08,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 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:08,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:08,723 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:08,723 INFO L186 Difference]: Start difference. First operand has 225 places, 211 transitions, 482 flow. Second operand 6 states and 1257 transitions. [2022-04-18 16:36:08,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 262 transitions, 808 flow [2022-04-18 16:36:08,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 262 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:08,728 INFO L242 Difference]: Finished difference. Result has 224 places, 210 transitions, 478 flow [2022-04-18 16:36:08,728 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=224, PETRI_TRANSITIONS=210} [2022-04-18 16:36:08,729 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-04-18 16:36:08,737 INFO L478 AbstractCegarLoop]: Abstraction has has 224 places, 210 transitions, 478 flow [2022-04-18 16:36:08,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,738 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:08,738 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] [2022-04-18 16:36:08,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 16:36:08,739 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2132503650, now seen corresponding path program 1 times [2022-04-18 16:36:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:08,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315469635] [2022-04-18 16:36:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 16:36:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315469635] [2022-04-18 16:36:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315469635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778846511] [2022-04-18 16:36:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:08,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:08,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:08,789 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 276 [2022-04-18 16:36:08,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:08,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 276 [2022-04-18 16:36:08,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:08,925 INFO L129 PetriNetUnfolder]: 223/965 cut-off events. [2022-04-18 16:36:08,926 INFO L130 PetriNetUnfolder]: For 182/219 co-relation queries the response was YES. [2022-04-18 16:36:08,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 965 events. 223/965 cut-off events. For 182/219 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5272 event pairs, 70 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1501. Up to 224 conditions per place. [2022-04-18 16:36:08,936 INFO L132 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-04-18 16:36:08,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 215 transitions, 544 flow [2022-04-18 16:36:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-04-18 16:36:08,939 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-04-18 16:36:08,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-04-18 16:36:08,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-04-18 16:36:08,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:08,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-04-18 16:36:08,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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:08,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:08,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:08,943 INFO L186 Difference]: Start difference. First operand has 224 places, 210 transitions, 478 flow. Second operand 3 states and 705 transitions. [2022-04-18 16:36:08,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 215 transitions, 544 flow [2022-04-18 16:36:08,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 215 transitions, 537 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:08,948 INFO L242 Difference]: Finished difference. Result has 221 places, 209 transitions, 473 flow [2022-04-18 16:36:08,948 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=221, PETRI_TRANSITIONS=209} [2022-04-18 16:36:08,949 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-04-18 16:36:08,949 INFO L478 AbstractCegarLoop]: Abstraction has has 221 places, 209 transitions, 473 flow [2022-04-18 16:36:08,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:36:08,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:08,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:08,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-18 16:36:08,950 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash 557492307, now seen corresponding path program 1 times [2022-04-18 16:36:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062416364] [2022-04-18 16:36:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062416364] [2022-04-18 16:36:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062416364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 16:36:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265073879] [2022-04-18 16:36:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:09,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 16:36:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:36:09,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 16:36:09,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 16:36:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:09,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-18 16:36:09,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 16:36:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:09,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 16:36:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:36:10,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265073879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 16:36:10,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 16:36:10,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-04-18 16:36:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691854521] [2022-04-18 16:36:10,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 16:36:10,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-18 16:36:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-18 16:36:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-18 16:36:10,272 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 276 [2022-04-18 16:36:10,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 209 transitions, 473 flow. Second operand has 19 states, 19 states have (on average 209.6315789473684) internal successors, (3983), 19 states have internal predecessors, (3983), 0 states have call successors, (0), 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:10,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:10,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 276 [2022-04-18 16:36:10,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:10,643 INFO L129 PetriNetUnfolder]: 134/1023 cut-off events. [2022-04-18 16:36:10,643 INFO L130 PetriNetUnfolder]: For 170/220 co-relation queries the response was YES. [2022-04-18 16:36:10,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1023 events. 134/1023 cut-off events. For 170/220 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5526 event pairs, 50 based on Foata normal form. 20/992 useless extension candidates. Maximal degree in co-relation 1520. Up to 135 conditions per place. [2022-04-18 16:36:10,650 INFO L132 encePairwiseOnDemand]: 262/276 looper letters, 46 selfloop transitions, 12 changer transitions 13/240 dead transitions. [2022-04-18 16:36:10,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 240 transitions, 697 flow [2022-04-18 16:36:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 16:36:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-04-18 16:36:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2751 transitions. [2022-04-18 16:36:10,657 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7667224080267558 [2022-04-18 16:36:10,658 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2751 transitions. [2022-04-18 16:36:10,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2751 transitions. [2022-04-18 16:36:10,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:10,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2751 transitions. [2022-04-18 16:36:10,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 211.6153846153846) internal successors, (2751), 13 states have internal predecessors, (2751), 0 states have call successors, (0), 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:10,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 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:10,673 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 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:10,674 INFO L186 Difference]: Start difference. First operand has 221 places, 209 transitions, 473 flow. Second operand 13 states and 2751 transitions. [2022-04-18 16:36:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 240 transitions, 697 flow [2022-04-18 16:36:10,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 240 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:36:10,679 INFO L242 Difference]: Finished difference. Result has 237 places, 213 transitions, 534 flow [2022-04-18 16:36:10,680 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=213} [2022-04-18 16:36:10,680 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -18 predicate places. [2022-04-18 16:36:10,680 INFO L478 AbstractCegarLoop]: Abstraction has has 237 places, 213 transitions, 534 flow [2022-04-18 16:36:10,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 209.6315789473684) internal successors, (3983), 19 states have internal predecessors, (3983), 0 states have call successors, (0), 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:10,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:10,682 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-18 16:36:10,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-18 16:36:10,896 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1184724180, now seen corresponding path program 2 times [2022-04-18 16:36:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:10,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306883071] [2022-04-18 16:36:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-18 16:36:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:11,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306883071] [2022-04-18 16:36:11,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306883071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:11,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:11,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:36:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432971454] [2022-04-18 16:36:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:11,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:36:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:11,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:36:11,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:36:11,048 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-04-18 16:36:11,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 213 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 198.16666666666666) internal successors, (1189), 6 states have internal predecessors, (1189), 0 states have call successors, (0), 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:11,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:11,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-04-18 16:36:11,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:12,117 INFO L129 PetriNetUnfolder]: 2487/5094 cut-off events. [2022-04-18 16:36:12,117 INFO L130 PetriNetUnfolder]: For 3085/3216 co-relation queries the response was YES. [2022-04-18 16:36:12,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11314 conditions, 5094 events. 2487/5094 cut-off events. For 3085/3216 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 39453 event pairs, 1693 based on Foata normal form. 0/4699 useless extension candidates. Maximal degree in co-relation 11246. Up to 3536 conditions per place. [2022-04-18 16:36:12,172 INFO L132 encePairwiseOnDemand]: 271/276 looper letters, 87 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-04-18 16:36:12,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 256 transitions, 834 flow [2022-04-18 16:36:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:36:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:36:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1248 transitions. [2022-04-18 16:36:12,177 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2022-04-18 16:36:12,177 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1248 transitions. [2022-04-18 16:36:12,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1248 transitions. [2022-04-18 16:36:12,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:12,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1248 transitions. [2022-04-18 16:36:12,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 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:12,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:12,183 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:12,184 INFO L186 Difference]: Start difference. First operand has 237 places, 213 transitions, 534 flow. Second operand 6 states and 1248 transitions. [2022-04-18 16:36:12,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 256 transitions, 834 flow [2022-04-18 16:36:12,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 256 transitions, 805 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-04-18 16:36:12,191 INFO L242 Difference]: Finished difference. Result has 233 places, 212 transitions, 519 flow [2022-04-18 16:36:12,191 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=233, PETRI_TRANSITIONS=212} [2022-04-18 16:36:12,192 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -22 predicate places. [2022-04-18 16:36:12,192 INFO L478 AbstractCegarLoop]: Abstraction has has 233 places, 212 transitions, 519 flow [2022-04-18 16:36:12,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.16666666666666) internal successors, (1189), 6 states have internal predecessors, (1189), 0 states have call successors, (0), 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:12,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:36:12,193 INFO L255 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-18 16:36:12,193 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-04-18 16:36:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:36:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2029694990, now seen corresponding path program 1 times [2022-04-18 16:36:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:36:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777057172] [2022-04-18 16:36:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:36:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:36:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:36:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-18 16:36:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:36:12,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777057172] [2022-04-18 16:36:12,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777057172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:36:12,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:36:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:36:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468245052] [2022-04-18 16:36:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:36:12,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:36:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:36:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:36:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:36:12,270 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-04-18 16:36:12,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 212 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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:12,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:36:12,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-04-18 16:36:12,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:36:12,458 INFO L129 PetriNetUnfolder]: 159/906 cut-off events. [2022-04-18 16:36:12,458 INFO L130 PetriNetUnfolder]: For 273/327 co-relation queries the response was YES. [2022-04-18 16:36:12,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 906 events. 159/906 cut-off events. For 273/327 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4770 event pairs, 70 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 1427. Up to 222 conditions per place. [2022-04-18 16:36:12,465 INFO L132 encePairwiseOnDemand]: 274/276 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2022-04-18 16:36:12,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 211 transitions, 549 flow [2022-04-18 16:36:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:36:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:36:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-04-18 16:36:12,468 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-04-18 16:36:12,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-04-18 16:36:12,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-04-18 16:36:12,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:36:12,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-04-18 16:36:12,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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:12,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:12,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:12,473 INFO L186 Difference]: Start difference. First operand has 233 places, 212 transitions, 519 flow. Second operand 3 states and 702 transitions. [2022-04-18 16:36:12,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 211 transitions, 549 flow [2022-04-18 16:36:12,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 211 transitions, 542 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:36:12,477 INFO L242 Difference]: Finished difference. Result has 230 places, 0 transitions, 0 flow [2022-04-18 16:36:12,478 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=230, PETRI_TRANSITIONS=0} [2022-04-18 16:36:12,478 INFO L335 CegarLoopForPetriNet]: 255 programPoint places, -25 predicate places. [2022-04-18 16:36:12,478 INFO L478 AbstractCegarLoop]: Abstraction has has 230 places, 0 transitions, 0 flow [2022-04-18 16:36:12,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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:12,481 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2022-04-18 16:36:12,482 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2022-04-18 16:36:12,482 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2022-04-18 16:36:12,482 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2022-04-18 16:36:12,482 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2022-04-18 16:36:12,482 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2022-04-18 16:36:12,483 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2022-04-18 16:36:12,483 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2022-04-18 16:36:12,483 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2022-04-18 16:36:12,483 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2022-04-18 16:36:12,483 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2022-04-18 16:36:12,484 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2022-04-18 16:36:12,484 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2022-04-18 16:36:12,484 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2022-04-18 16:36:12,484 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2022-04-18 16:36:12,484 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2022-04-18 16:36:12,485 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2022-04-18 16:36:12,485 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2022-04-18 16:36:12,485 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2022-04-18 16:36:12,485 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2022-04-18 16:36:12,485 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2022-04-18 16:36:12,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2022-04-18 16:36:12,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2022-04-18 16:36:12,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2022-04-18 16:36:12,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2022-04-18 16:36:12,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2022-04-18 16:36:12,486 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2022-04-18 16:36:12,487 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2022-04-18 16:36:12,487 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2022-04-18 16:36:12,487 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2022-04-18 16:36:12,487 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2022-04-18 16:36:12,487 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2022-04-18 16:36:12,488 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2022-04-18 16:36:12,488 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2022-04-18 16:36:12,488 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2022-04-18 16:36:12,488 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2022-04-18 16:36:12,488 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2022-04-18 16:36:12,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2022-04-18 16:36:12,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2022-04-18 16:36:12,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2022-04-18 16:36:12,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2022-04-18 16:36:12,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2022-04-18 16:36:12,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2022-04-18 16:36:12,490 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2022-04-18 16:36:12,490 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 80 remaining) [2022-04-18 16:36:12,490 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2022-04-18 16:36:12,490 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2022-04-18 16:36:12,490 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 80 remaining) [2022-04-18 16:36:12,491 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2022-04-18 16:36:12,491 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2022-04-18 16:36:12,491 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2022-04-18 16:36:12,491 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2022-04-18 16:36:12,491 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2022-04-18 16:36:12,492 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2022-04-18 16:36:12,492 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2022-04-18 16:36:12,492 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2022-04-18 16:36:12,492 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2022-04-18 16:36:12,492 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2022-04-18 16:36:12,493 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2022-04-18 16:36:12,493 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2022-04-18 16:36:12,493 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2022-04-18 16:36:12,493 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2022-04-18 16:36:12,493 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2022-04-18 16:36:12,493 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2022-04-18 16:36:12,494 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2022-04-18 16:36:12,494 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2022-04-18 16:36:12,494 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2022-04-18 16:36:12,494 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2022-04-18 16:36:12,494 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2022-04-18 16:36:12,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2022-04-18 16:36:12,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2022-04-18 16:36:12,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2022-04-18 16:36:12,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2022-04-18 16:36:12,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2022-04-18 16:36:12,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2022-04-18 16:36:12,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2022-04-18 16:36:12,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2022-04-18 16:36:12,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2022-04-18 16:36:12,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2022-04-18 16:36:12,496 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2022-04-18 16:36:12,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-18 16:36:12,500 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:36:12,505 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 16:36:12,505 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 16:36:12,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 04:36:12 BasicIcfg [2022-04-18 16:36:12,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 16:36:12,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 16:36:12,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 16:36:12,509 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 16:36:12,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:35:58" (3/4) ... [2022-04-18 16:36:12,512 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-04-18 16:36:12,516 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-04-18 16:36:12,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-04-18 16:36:12,517 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-04-18 16:36:12,521 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-04-18 16:36:12,522 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-04-18 16:36:12,522 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-04-18 16:36:12,522 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-04-18 16:36:12,572 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-04-18 16:36:12,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 16:36:12,573 INFO L158 Benchmark]: Toolchain (without parser) took 15608.95ms. Allocated memory was 107.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 72.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 711.4MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,573 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory was 77.4MB in the beginning and 77.3MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 16:36:12,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.52ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 80.1MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.29ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 77.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,574 INFO L158 Benchmark]: Boogie Preprocessor took 56.68ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 74.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,574 INFO L158 Benchmark]: RCFGBuilder took 996.60ms. Allocated memory is still 107.0MB. Free memory was 74.5MB in the beginning and 73.8MB in the end (delta: 695.2kB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,575 INFO L158 Benchmark]: TraceAbstraction took 14136.59ms. Allocated memory was 107.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 73.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 707.1MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,575 INFO L158 Benchmark]: Witness Printer took 63.54ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-04-18 16:36:12,578 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory was 77.4MB in the beginning and 77.3MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.52ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 80.1MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.29ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 77.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.68ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 74.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 996.60ms. Allocated memory is still 107.0MB. Free memory was 74.5MB in the beginning and 73.8MB in the end (delta: 695.2kB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14136.59ms. Allocated memory was 107.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 73.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 707.1MB. Max. memory is 16.1GB. * Witness Printer took 63.54ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 360 locations, 80 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.0s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2059 IncrementalHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 276 mSDtfsCounter, 2059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=18, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 4019 SizeOfPredicates, 6 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 34/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-18 16:36:12,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE