/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.1-5b77e9fc37942d960732eb3788a90132329d3bc4-5b77e9f
[2021-10-19 14:39:15,229 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-19 14:39:15,230 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-19 14:39:15,272 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-19 14:39:15,273 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-19 14:39:15,274 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-19 14:39:15,274 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-19 14:39:15,276 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-19 14:39:15,283 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-19 14:39:15,286 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-19 14:39:15,286 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-19 14:39:15,287 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-19 14:39:15,287 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-19 14:39:15,288 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-19 14:39:15,289 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-19 14:39:15,289 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-19 14:39:15,290 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-19 14:39:15,290 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-19 14:39:15,291 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-19 14:39:15,293 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-19 14:39:15,293 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-19 14:39:15,294 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-19 14:39:15,295 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-19 14:39:15,296 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-19 14:39:15,297 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-19 14:39:15,298 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-19 14:39:15,298 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-19 14:39:15,298 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-19 14:39:15,299 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-19 14:39:15,299 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-19 14:39:15,299 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-19 14:39:15,300 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-19 14:39:15,300 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-19 14:39:15,301 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-19 14:39:15,301 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-19 14:39:15,301 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-19 14:39:15,302 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-19 14:39:15,302 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-19 14:39:15,302 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-19 14:39:15,303 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-19 14:39:15,303 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-19 14:39:15,304 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf
[2021-10-19 14:39:15,321 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-19 14:39:15,321 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-19 14:39:15,322 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-19 14:39:15,322 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-19 14:39:15,322 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-19 14:39:15,322 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-19 14:39:15,323 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-10-19 14:39:15,324 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-19 14:39:15,324 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-19 14:39:15,324 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-19 14:39:15,325 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-10-19 14:39:15,325 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-10-19 14:39:15,325 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: Check absence of data races in concurrent programs -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false
[2021-10-19 14:39:15,516 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-19 14:39:15,536 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-19 14:39:15,538 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-19 14:39:15,539 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-19 14:39:15,541 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-19 14:39:15,541 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c
[2021-10-19 14:39:15,588 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04be5947a/088c41c0d27340ab96892add90ecc289/FLAGb380ee1ca
[2021-10-19 14:39:15,941 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-19 14:39:15,942 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c
[2021-10-19 14:39:15,946 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04be5947a/088c41c0d27340ab96892add90ecc289/FLAGb380ee1ca
[2021-10-19 14:39:16,359 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04be5947a/088c41c0d27340ab96892add90ecc289
[2021-10-19 14:39:16,360 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-19 14:39:16,361 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-10-19 14:39:16,364 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-19 14:39:16,364 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-19 14:39:16,366 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-19 14:39:16,367 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,367 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b55ef62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16, skipping insertion in model container
[2021-10-19 14:39:16,367 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,372 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-19 14:39:16,392 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-19 14:39:16,556 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c[3305,3318]
[2021-10-19 14:39:16,567 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-19 14:39:16,572 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-19 14:39:16,608 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c[3305,3318]
[2021-10-19 14:39:16,612 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-19 14:39:16,625 INFO  L208         MainTranslator]: Completed translation
[2021-10-19 14:39:16,625 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16 WrapperNode
[2021-10-19 14:39:16,625 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-19 14:39:16,627 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-19 14:39:16,627 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-19 14:39:16,627 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-19 14:39:16,632 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,651 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,688 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-19 14:39:16,688 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-19 14:39:16,688 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-19 14:39:16,688 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-19 14:39:16,694 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,694 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,698 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,698 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,728 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,746 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,748 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,751 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-19 14:39:16,752 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-19 14:39:16,752 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-19 14:39:16,752 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-19 14:39:16,764 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (1/1) ...
[2021-10-19 14:39:16,770 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-19 14:39:16,777 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-10-19 14:39:16,831 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)
[2021-10-19 14:39:16,851 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
[2021-10-19 14:39:16,863 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-19 14:39:16,863 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-10-19 14:39:16,863 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-10-19 14:39:16,864 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2021-10-19 14:39:16,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2021-10-19 14:39:16,864 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2021-10-19 14:39:16,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2021-10-19 14:39:16,864 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-19 14:39:16,865 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2021-10-19 14:39:16,865 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-19 14:39:16,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-19 14:39:16,865 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-19 14:39:16,866 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-10-19 14:39:17,522 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-19 14:39:17,522 INFO  L299             CfgBuilder]: Removed 52 assume(true) statements.
[2021-10-19 14:39:17,524 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 02:39:17 BoogieIcfgContainer
[2021-10-19 14:39:17,524 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-19 14:39:17,525 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-19 14:39:17,525 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-10-19 14:39:17,528 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-10-19 14:39:17,528 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 02:39:16" (1/3) ...
[2021-10-19 14:39:17,528 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518ada4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 02:39:17, skipping insertion in model container
[2021-10-19 14:39:17,528 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:39:16" (2/3) ...
[2021-10-19 14:39:17,529 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518ada4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 02:39:17, skipping insertion in model container
[2021-10-19 14:39:17,529 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 02:39:17" (3/3) ...
[2021-10-19 14:39:17,530 INFO  L111   eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c
[2021-10-19 14:39:17,533 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-19 14:39:17,533 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations.
[2021-10-19 14:39:17,533 INFO  L516   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-19 14:39:17,583 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,583 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,584 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,584 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,584 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,584 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,584 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,584 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,585 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,586 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,587 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,588 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,589 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,590 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,590 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,590 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,590 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,590 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,590 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,591 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,592 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,592 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,592 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,592 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,592 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,592 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,593 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,594 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,595 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,596 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,597 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,598 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,599 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,600 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,601 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,602 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,603 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,605 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,605 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,605 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,606 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,607 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,608 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,609 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,610 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,611 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,611 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,611 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,611 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,611 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,611 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,612 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,613 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,614 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,615 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,616 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,617 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,618 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,619 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,620 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,621 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,622 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,624 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,625 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,626 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,627 WARN  L313   ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~a not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_minus_~b not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,630 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,631 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,632 WARN  L313   ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,632 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,632 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,632 WARN  L313   ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-19 14:39:17,636 INFO  L148    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2021-10-19 14:39:17,670 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-10-19 14:39:17,675 INFO  L339      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=false, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR
[2021-10-19 14:39:17,675 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 132 error locations.
[2021-10-19 14:39:17,690 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 660 places, 690 transitions, 1396 flow
[2021-10-19 14:39:17,875 INFO  L129       PetriNetUnfolder]: 37/688 cut-off events.
[2021-10-19 14:39:17,876 INFO  L130       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2021-10-19 14:39:17,885 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 697 conditions, 688 events. 37/688 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1210 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 472. Up to 2 conditions per place. 
[2021-10-19 14:39:17,886 INFO  L82        GeneralOperation]: Start removeDead. Operand has 660 places, 690 transitions, 1396 flow
[2021-10-19 14:39:17,899 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 635 places, 662 transitions, 1336 flow
[2021-10-19 14:39:17,902 INFO  L129       PetriNetUnfolder]: 0/28 cut-off events.
[2021-10-19 14:39:17,902 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:17,902 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:17,902 INFO  L254   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]
[2021-10-19 14:39:17,903 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:17,909 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:17,909 INFO  L82        PathProgramCache]: Analyzing trace with hash -192457102, now seen corresponding path program 1 times
[2021-10-19 14:39:17,916 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:17,916 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560384875]
[2021-10-19 14:39:17,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:17,917 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:17,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:18,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:18,053 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:18,053 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560384875]
[2021-10-19 14:39:18,054 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560384875] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:18,054 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:18,054 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:18,055 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919487927]
[2021-10-19 14:39:18,063 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:18,064 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:18,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:18,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:18,084 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 633 out of 690
[2021-10-19 14:39:18,090 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 662 transitions, 1336 flow. Second operand  has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,090 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:18,090 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 690
[2021-10-19 14:39:18,091 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:18,528 INFO  L129       PetriNetUnfolder]: 153/2295 cut-off events.
[2021-10-19 14:39:18,528 INFO  L130       PetriNetUnfolder]: For 8/8 co-relation queries the response was YES.
[2021-10-19 14:39:18,539 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 2295 events. 153/2295 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14790 event pairs, 81 based on Foata normal form. 47/1874 useless extension candidates. Maximal degree in co-relation 2159. Up to 201 conditions per place. 
[2021-10-19 14:39:18,550 INFO  L132   encePairwiseOnDemand]: 668/690 looper letters, 33 selfloop transitions, 2 changer transitions 11/642 dead transitions.
[2021-10-19 14:39:18,550 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 642 transitions, 1366 flow
[2021-10-19 14:39:18,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:18,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:18,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1954 transitions.
[2021-10-19 14:39:18,568 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9439613526570049
[2021-10-19 14:39:18,568 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1954 transitions.
[2021-10-19 14:39:18,569 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1954 transitions.
[2021-10-19 14:39:18,572 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:18,574 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1954 transitions.
[2021-10-19 14:39:18,580 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,588 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,590 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,591 INFO  L186             Difference]: Start difference. First operand has 635 places, 662 transitions, 1336 flow. Second operand 3 states and 1954 transitions.
[2021-10-19 14:39:18,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 642 transitions, 1366 flow
[2021-10-19 14:39:18,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 642 transitions, 1358 flow, removed 0 selfloop flow, removed 4 redundant places.
[2021-10-19 14:39:18,613 INFO  L242             Difference]: Finished difference. Result has 632 places, 631 transitions, 1270 flow
[2021-10-19 14:39:18,616 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1270, PETRI_PLACES=632, PETRI_TRANSITIONS=631}
[2021-10-19 14:39:18,617 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -3 predicate places.
[2021-10-19 14:39:18,617 INFO  L470      AbstractCegarLoop]: Abstraction has has 632 places, 631 transitions, 1270 flow
[2021-10-19 14:39:18,618 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,618 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:18,618 INFO  L254   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]
[2021-10-19 14:39:18,619 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-19 14:39:18,619 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:18,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:18,620 INFO  L82        PathProgramCache]: Analyzing trace with hash 484660100, now seen corresponding path program 1 times
[2021-10-19 14:39:18,621 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:18,621 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64493994]
[2021-10-19 14:39:18,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:18,621 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:18,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:18,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:18,674 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:18,674 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64493994]
[2021-10-19 14:39:18,675 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64493994] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:18,675 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:18,675 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:18,675 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825803359]
[2021-10-19 14:39:18,676 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:18,676 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:18,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:18,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:18,680 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 636 out of 690
[2021-10-19 14:39:18,682 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 631 transitions, 1270 flow. Second operand  has 3 states, 3 states have (on average 637.3333333333334) internal successors, (1912), 3 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,682 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:18,682 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 636 of 690
[2021-10-19 14:39:18,682 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:18,966 INFO  L129       PetriNetUnfolder]: 92/1782 cut-off events.
[2021-10-19 14:39:18,967 INFO  L130       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2021-10-19 14:39:18,977 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1782 events. 92/1782 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9980 event pairs, 36 based on Foata normal form. 0/1474 useless extension candidates. Maximal degree in co-relation 1849. Up to 95 conditions per place. 
[2021-10-19 14:39:18,988 INFO  L132   encePairwiseOnDemand]: 679/690 looper letters, 21 selfloop transitions, 1 changer transitions 0/621 dead transitions.
[2021-10-19 14:39:18,988 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 621 transitions, 1294 flow
[2021-10-19 14:39:18,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:18,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:18,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1940 transitions.
[2021-10-19 14:39:18,992 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9371980676328503
[2021-10-19 14:39:18,992 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1940 transitions.
[2021-10-19 14:39:18,992 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1940 transitions.
[2021-10-19 14:39:18,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:18,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1940 transitions.
[2021-10-19 14:39:18,996 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 646.6666666666666) internal successors, (1940), 3 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:18,999 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,000 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,000 INFO  L186             Difference]: Start difference. First operand has 632 places, 631 transitions, 1270 flow. Second operand 3 states and 1940 transitions.
[2021-10-19 14:39:19,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 621 transitions, 1294 flow
[2021-10-19 14:39:19,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 621 transitions, 1290 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:19,008 INFO  L242             Difference]: Finished difference. Result has 611 places, 621 transitions, 1248 flow
[2021-10-19 14:39:19,009 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=611, PETRI_TRANSITIONS=621}
[2021-10-19 14:39:19,010 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -24 predicate places.
[2021-10-19 14:39:19,010 INFO  L470      AbstractCegarLoop]: Abstraction has has 611 places, 621 transitions, 1248 flow
[2021-10-19 14:39:19,011 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 637.3333333333334) internal successors, (1912), 3 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,011 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:19,011 INFO  L254   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]
[2021-10-19 14:39:19,011 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-19 14:39:19,011 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:19,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:19,013 INFO  L82        PathProgramCache]: Analyzing trace with hash 1965922349, now seen corresponding path program 1 times
[2021-10-19 14:39:19,013 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:19,013 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692271646]
[2021-10-19 14:39:19,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:19,014 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:19,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:19,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:19,072 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:19,072 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692271646]
[2021-10-19 14:39:19,073 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692271646] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:19,073 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:19,073 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:19,073 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874818708]
[2021-10-19 14:39:19,074 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:19,074 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:19,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:19,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:19,077 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 633 out of 690
[2021-10-19 14:39:19,079 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 621 transitions, 1248 flow. Second operand  has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,079 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:19,079 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 633 of 690
[2021-10-19 14:39:19,079 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:19,358 INFO  L129       PetriNetUnfolder]: 148/2310 cut-off events.
[2021-10-19 14:39:19,358 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:19,369 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 2310 events. 148/2310 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 14602 event pairs, 81 based on Foata normal form. 0/1892 useless extension candidates. Maximal degree in co-relation 2482. Up to 201 conditions per place. 
[2021-10-19 14:39:19,383 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 33 selfloop transitions, 2 changer transitions 0/620 dead transitions.
[2021-10-19 14:39:19,383 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 620 transitions, 1316 flow
[2021-10-19 14:39:19,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:19,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:19,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1935 transitions.
[2021-10-19 14:39:19,386 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9347826086956522
[2021-10-19 14:39:19,386 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1935 transitions.
[2021-10-19 14:39:19,386 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1935 transitions.
[2021-10-19 14:39:19,387 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:19,387 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1935 transitions.
[2021-10-19 14:39:19,390 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 645.0) internal successors, (1935), 3 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,392 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,394 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,394 INFO  L186             Difference]: Start difference. First operand has 611 places, 621 transitions, 1248 flow. Second operand 3 states and 1935 transitions.
[2021-10-19 14:39:19,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 620 transitions, 1316 flow
[2021-10-19 14:39:19,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 620 transitions, 1315 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-10-19 14:39:19,402 INFO  L242             Difference]: Finished difference. Result has 611 places, 620 transitions, 1249 flow
[2021-10-19 14:39:19,403 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1249, PETRI_PLACES=611, PETRI_TRANSITIONS=620}
[2021-10-19 14:39:19,403 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -24 predicate places.
[2021-10-19 14:39:19,403 INFO  L470      AbstractCegarLoop]: Abstraction has has 611 places, 620 transitions, 1249 flow
[2021-10-19 14:39:19,404 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,404 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:19,404 INFO  L254   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]
[2021-10-19 14:39:19,405 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-19 14:39:19,405 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:19,405 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:19,405 INFO  L82        PathProgramCache]: Analyzing trace with hash 2029959312, now seen corresponding path program 1 times
[2021-10-19 14:39:19,405 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:19,405 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613346726]
[2021-10-19 14:39:19,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:19,406 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:19,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:19,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:19,455 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:19,455 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613346726]
[2021-10-19 14:39:19,455 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613346726] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:19,455 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:19,455 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:19,455 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171468619]
[2021-10-19 14:39:19,455 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:19,455 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:19,456 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:19,456 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:19,458 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 636 out of 690
[2021-10-19 14:39:19,464 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 620 transitions, 1249 flow. Second operand  has 3 states, 3 states have (on average 637.3333333333334) internal successors, (1912), 3 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,464 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:19,464 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 636 of 690
[2021-10-19 14:39:19,464 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:19,703 INFO  L129       PetriNetUnfolder]: 90/1784 cut-off events.
[2021-10-19 14:39:19,703 INFO  L130       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2021-10-19 14:39:19,713 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1784 events. 90/1784 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9821 event pairs, 36 based on Foata normal form. 0/1507 useless extension candidates. Maximal degree in co-relation 1854. Up to 95 conditions per place. 
[2021-10-19 14:39:19,720 INFO  L132   encePairwiseOnDemand]: 679/690 looper letters, 21 selfloop transitions, 1 changer transitions 0/610 dead transitions.
[2021-10-19 14:39:19,720 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 610 transitions, 1273 flow
[2021-10-19 14:39:19,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:19,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:19,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1940 transitions.
[2021-10-19 14:39:19,724 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9371980676328503
[2021-10-19 14:39:19,724 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1940 transitions.
[2021-10-19 14:39:19,724 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1940 transitions.
[2021-10-19 14:39:19,724 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:19,724 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1940 transitions.
[2021-10-19 14:39:19,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 646.6666666666666) internal successors, (1940), 3 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,730 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,731 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,731 INFO  L186             Difference]: Start difference. First operand has 611 places, 620 transitions, 1249 flow. Second operand 3 states and 1940 transitions.
[2021-10-19 14:39:19,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 610 transitions, 1273 flow
[2021-10-19 14:39:19,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 610 transitions, 1269 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:19,739 INFO  L242             Difference]: Finished difference. Result has 601 places, 610 transitions, 1227 flow
[2021-10-19 14:39:19,740 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=601, PETRI_TRANSITIONS=610}
[2021-10-19 14:39:19,740 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -34 predicate places.
[2021-10-19 14:39:19,740 INFO  L470      AbstractCegarLoop]: Abstraction has has 601 places, 610 transitions, 1227 flow
[2021-10-19 14:39:19,741 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 637.3333333333334) internal successors, (1912), 3 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,741 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:19,741 INFO  L254   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]
[2021-10-19 14:39:19,741 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-19 14:39:19,741 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:19,743 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:19,743 INFO  L82        PathProgramCache]: Analyzing trace with hash 316736351, now seen corresponding path program 1 times
[2021-10-19 14:39:19,743 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:19,743 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379363307]
[2021-10-19 14:39:19,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:19,743 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:19,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:19,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:19,783 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:19,783 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379363307]
[2021-10-19 14:39:19,784 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379363307] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:19,784 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:19,784 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:19,784 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939165574]
[2021-10-19 14:39:19,784 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:19,784 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:19,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:19,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:19,787 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:19,789 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 610 transitions, 1227 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,789 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:19,789 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:19,789 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:19,853 INFO  L129       PetriNetUnfolder]: 15/609 cut-off events.
[2021-10-19 14:39:19,853 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:19,858 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 630 conditions, 609 events. 15/609 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1081 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 594. Up to 13 conditions per place. 
[2021-10-19 14:39:19,860 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 12 selfloop transitions, 2 changer transitions 0/609 dead transitions.
[2021-10-19 14:39:19,860 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 609 transitions, 1253 flow
[2021-10-19 14:39:19,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:19,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:19,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions.
[2021-10-19 14:39:19,863 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9550724637681159
[2021-10-19 14:39:19,863 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:19,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:19,863 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:19,863 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:19,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,869 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,870 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,870 INFO  L186             Difference]: Start difference. First operand has 601 places, 610 transitions, 1227 flow. Second operand 3 states and 1977 transitions.
[2021-10-19 14:39:19,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 609 transitions, 1253 flow
[2021-10-19 14:39:19,873 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 609 transitions, 1252 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-10-19 14:39:19,878 INFO  L242             Difference]: Finished difference. Result has 601 places, 609 transitions, 1228 flow
[2021-10-19 14:39:19,879 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=601, PETRI_TRANSITIONS=609}
[2021-10-19 14:39:19,879 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -34 predicate places.
[2021-10-19 14:39:19,879 INFO  L470      AbstractCegarLoop]: Abstraction has has 601 places, 609 transitions, 1228 flow
[2021-10-19 14:39:19,880 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,880 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:19,880 INFO  L254   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]
[2021-10-19 14:39:19,881 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-19 14:39:19,881 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:19,881 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:19,881 INFO  L82        PathProgramCache]: Analyzing trace with hash 1705598123, now seen corresponding path program 1 times
[2021-10-19 14:39:19,881 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:19,881 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139148178]
[2021-10-19 14:39:19,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:19,881 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:19,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:19,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:19,928 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:19,928 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139148178]
[2021-10-19 14:39:19,928 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139148178] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:19,928 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:19,928 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:19,929 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202774003]
[2021-10-19 14:39:19,929 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:19,929 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:19,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:19,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:19,931 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:19,933 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 609 transitions, 1228 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:19,933 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:19,933 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:19,933 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:19,997 INFO  L129       PetriNetUnfolder]: 15/608 cut-off events.
[2021-10-19 14:39:19,997 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:20,001 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 631 conditions, 608 events. 15/608 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1079 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 595. Up to 13 conditions per place. 
[2021-10-19 14:39:20,004 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 12 selfloop transitions, 2 changer transitions 0/608 dead transitions.
[2021-10-19 14:39:20,004 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 608 transitions, 1254 flow
[2021-10-19 14:39:20,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:20,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:20,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions.
[2021-10-19 14:39:20,008 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9550724637681159
[2021-10-19 14:39:20,008 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,008 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:20,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,012 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,019 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,020 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,020 INFO  L186             Difference]: Start difference. First operand has 601 places, 609 transitions, 1228 flow. Second operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,020 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 608 transitions, 1254 flow
[2021-10-19 14:39:20,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 608 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:20,027 INFO  L242             Difference]: Finished difference. Result has 600 places, 608 transitions, 1226 flow
[2021-10-19 14:39:20,028 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=600, PETRI_TRANSITIONS=608}
[2021-10-19 14:39:20,028 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -35 predicate places.
[2021-10-19 14:39:20,028 INFO  L470      AbstractCegarLoop]: Abstraction has has 600 places, 608 transitions, 1226 flow
[2021-10-19 14:39:20,029 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,029 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:20,029 INFO  L254   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]
[2021-10-19 14:39:20,029 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-19 14:39:20,029 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:20,030 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:20,030 INFO  L82        PathProgramCache]: Analyzing trace with hash 1708563300, now seen corresponding path program 1 times
[2021-10-19 14:39:20,030 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:20,030 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666537578]
[2021-10-19 14:39:20,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:20,030 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:20,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:20,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:20,065 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:20,065 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666537578]
[2021-10-19 14:39:20,065 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666537578] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:20,066 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:20,066 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:20,066 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487349364]
[2021-10-19 14:39:20,066 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:20,066 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:20,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:20,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:20,071 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:20,072 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 608 transitions, 1226 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,072 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:20,072 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:20,072 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:20,139 INFO  L129       PetriNetUnfolder]: 15/607 cut-off events.
[2021-10-19 14:39:20,140 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:20,143 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 630 conditions, 607 events. 15/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1077 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 594. Up to 13 conditions per place. 
[2021-10-19 14:39:20,145 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 12 selfloop transitions, 2 changer transitions 0/607 dead transitions.
[2021-10-19 14:39:20,145 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 607 transitions, 1252 flow
[2021-10-19 14:39:20,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:20,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:20,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions.
[2021-10-19 14:39:20,149 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9550724637681159
[2021-10-19 14:39:20,149 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,150 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:20,150 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,152 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,155 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,155 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,155 INFO  L186             Difference]: Start difference. First operand has 600 places, 608 transitions, 1226 flow. Second operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,155 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 607 transitions, 1252 flow
[2021-10-19 14:39:20,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 607 transitions, 1248 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:20,162 INFO  L242             Difference]: Finished difference. Result has 599 places, 607 transitions, 1224 flow
[2021-10-19 14:39:20,163 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=599, PETRI_TRANSITIONS=607}
[2021-10-19 14:39:20,163 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -36 predicate places.
[2021-10-19 14:39:20,163 INFO  L470      AbstractCegarLoop]: Abstraction has has 599 places, 607 transitions, 1224 flow
[2021-10-19 14:39:20,164 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,164 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:20,164 INFO  L254   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]
[2021-10-19 14:39:20,164 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-19 14:39:20,164 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:20,164 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:20,164 INFO  L82        PathProgramCache]: Analyzing trace with hash 1570578708, now seen corresponding path program 1 times
[2021-10-19 14:39:20,164 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:20,164 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423505339]
[2021-10-19 14:39:20,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:20,165 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:20,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:20,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:20,206 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:20,207 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423505339]
[2021-10-19 14:39:20,207 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423505339] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:20,207 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:20,207 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:20,207 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873503527]
[2021-10-19 14:39:20,207 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:20,207 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:20,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:20,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:20,209 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:20,210 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 607 transitions, 1224 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,210 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:20,210 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:20,210 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:20,271 INFO  L129       PetriNetUnfolder]: 15/606 cut-off events.
[2021-10-19 14:39:20,271 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:20,276 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 628 conditions, 606 events. 15/606 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1076 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 592. Up to 12 conditions per place. 
[2021-10-19 14:39:20,278 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 11 selfloop transitions, 2 changer transitions 0/606 dead transitions.
[2021-10-19 14:39:20,278 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 606 transitions, 1248 flow
[2021-10-19 14:39:20,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:20,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:20,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions.
[2021-10-19 14:39:20,282 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9545893719806763
[2021-10-19 14:39:20,282 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions.
[2021-10-19 14:39:20,282 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions.
[2021-10-19 14:39:20,282 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:20,283 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions.
[2021-10-19 14:39:20,285 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,287 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,287 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,287 INFO  L186             Difference]: Start difference. First operand has 599 places, 607 transitions, 1224 flow. Second operand 3 states and 1976 transitions.
[2021-10-19 14:39:20,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 606 transitions, 1248 flow
[2021-10-19 14:39:20,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 606 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:20,294 INFO  L242             Difference]: Finished difference. Result has 598 places, 606 transitions, 1222 flow
[2021-10-19 14:39:20,295 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=598, PETRI_TRANSITIONS=606}
[2021-10-19 14:39:20,295 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -37 predicate places.
[2021-10-19 14:39:20,295 INFO  L470      AbstractCegarLoop]: Abstraction has has 598 places, 606 transitions, 1222 flow
[2021-10-19 14:39:20,296 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,296 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:20,296 INFO  L254   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]
[2021-10-19 14:39:20,296 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-19 14:39:20,296 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:20,296 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:20,296 INFO  L82        PathProgramCache]: Analyzing trace with hash -876811025, now seen corresponding path program 1 times
[2021-10-19 14:39:20,297 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:20,297 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868713948]
[2021-10-19 14:39:20,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:20,297 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:20,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:20,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:20,322 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:20,322 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868713948]
[2021-10-19 14:39:20,322 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868713948] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:20,322 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:20,322 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:20,322 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191942014]
[2021-10-19 14:39:20,322 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:20,322 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:20,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:20,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:20,325 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:20,326 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 606 transitions, 1222 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,326 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:20,326 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:20,326 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:20,390 INFO  L129       PetriNetUnfolder]: 15/605 cut-off events.
[2021-10-19 14:39:20,390 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:20,395 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 628 conditions, 605 events. 15/605 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1076 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 592. Up to 13 conditions per place. 
[2021-10-19 14:39:20,397 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 12 selfloop transitions, 2 changer transitions 0/605 dead transitions.
[2021-10-19 14:39:20,397 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 605 transitions, 1248 flow
[2021-10-19 14:39:20,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:20,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:20,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions.
[2021-10-19 14:39:20,400 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9550724637681159
[2021-10-19 14:39:20,400 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,401 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:20,401 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,403 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,405 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,406 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,406 INFO  L186             Difference]: Start difference. First operand has 598 places, 606 transitions, 1222 flow. Second operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 605 transitions, 1248 flow
[2021-10-19 14:39:20,408 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 605 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:20,413 INFO  L242             Difference]: Finished difference. Result has 597 places, 605 transitions, 1220 flow
[2021-10-19 14:39:20,413 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1220, PETRI_PLACES=597, PETRI_TRANSITIONS=605}
[2021-10-19 14:39:20,414 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -38 predicate places.
[2021-10-19 14:39:20,414 INFO  L470      AbstractCegarLoop]: Abstraction has has 597 places, 605 transitions, 1220 flow
[2021-10-19 14:39:20,414 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,414 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:20,414 INFO  L254   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]
[2021-10-19 14:39:20,414 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-19 14:39:20,415 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:20,415 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:20,415 INFO  L82        PathProgramCache]: Analyzing trace with hash 1286560246, now seen corresponding path program 1 times
[2021-10-19 14:39:20,415 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:20,415 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429504534]
[2021-10-19 14:39:20,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:20,416 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:20,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:20,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:20,438 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:20,438 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429504534]
[2021-10-19 14:39:20,438 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429504534] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:20,438 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:20,439 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:20,439 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686050639]
[2021-10-19 14:39:20,439 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:20,439 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:20,439 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:20,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:20,444 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:20,445 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 605 transitions, 1220 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,445 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:20,445 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:20,445 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:20,506 INFO  L129       PetriNetUnfolder]: 15/604 cut-off events.
[2021-10-19 14:39:20,506 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:20,510 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 627 conditions, 604 events. 15/604 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1073 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 591. Up to 13 conditions per place. 
[2021-10-19 14:39:20,512 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 12 selfloop transitions, 2 changer transitions 0/604 dead transitions.
[2021-10-19 14:39:20,513 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 604 transitions, 1246 flow
[2021-10-19 14:39:20,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:20,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:20,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1977 transitions.
[2021-10-19 14:39:20,516 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9550724637681159
[2021-10-19 14:39:20,516 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,516 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,516 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:20,516 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,518 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,520 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,521 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,521 INFO  L186             Difference]: Start difference. First operand has 597 places, 605 transitions, 1220 flow. Second operand 3 states and 1977 transitions.
[2021-10-19 14:39:20,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 604 transitions, 1246 flow
[2021-10-19 14:39:20,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 604 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:20,528 INFO  L242             Difference]: Finished difference. Result has 596 places, 604 transitions, 1218 flow
[2021-10-19 14:39:20,529 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=596, PETRI_TRANSITIONS=604}
[2021-10-19 14:39:20,530 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -39 predicate places.
[2021-10-19 14:39:20,530 INFO  L470      AbstractCegarLoop]: Abstraction has has 596 places, 604 transitions, 1218 flow
[2021-10-19 14:39:20,530 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,530 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:20,530 INFO  L254   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]
[2021-10-19 14:39:20,531 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-19 14:39:20,531 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:20,532 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:20,532 INFO  L82        PathProgramCache]: Analyzing trace with hash 1152995455, now seen corresponding path program 1 times
[2021-10-19 14:39:20,532 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:20,533 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284573654]
[2021-10-19 14:39:20,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:20,533 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:20,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:20,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:20,560 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:20,560 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284573654]
[2021-10-19 14:39:20,560 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284573654] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:20,561 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:20,561 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:20,562 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226704207]
[2021-10-19 14:39:20,562 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:20,562 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:20,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:20,563 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:20,564 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 651 out of 690
[2021-10-19 14:39:20,565 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 604 transitions, 1218 flow. Second operand  has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,565 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:20,565 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 690
[2021-10-19 14:39:20,565 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:20,737 INFO  L129       PetriNetUnfolder]: 73/1583 cut-off events.
[2021-10-19 14:39:20,737 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:20,741 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1583 events. 73/1583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7820 event pairs, 36 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 1645. Up to 88 conditions per place. 
[2021-10-19 14:39:20,745 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 15 selfloop transitions, 2 changer transitions 0/603 dead transitions.
[2021-10-19 14:39:20,745 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 603 transitions, 1250 flow
[2021-10-19 14:39:20,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:20,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:20,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1971 transitions.
[2021-10-19 14:39:20,749 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9521739130434783
[2021-10-19 14:39:20,749 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1971 transitions.
[2021-10-19 14:39:20,749 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1971 transitions.
[2021-10-19 14:39:20,749 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:20,749 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1971 transitions.
[2021-10-19 14:39:20,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,754 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,754 INFO  L186             Difference]: Start difference. First operand has 596 places, 604 transitions, 1218 flow. Second operand 3 states and 1971 transitions.
[2021-10-19 14:39:20,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 603 transitions, 1250 flow
[2021-10-19 14:39:20,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 603 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:20,760 INFO  L242             Difference]: Finished difference. Result has 595 places, 603 transitions, 1216 flow
[2021-10-19 14:39:20,761 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=595, PETRI_TRANSITIONS=603}
[2021-10-19 14:39:20,762 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -40 predicate places.
[2021-10-19 14:39:20,762 INFO  L470      AbstractCegarLoop]: Abstraction has has 595 places, 603 transitions, 1216 flow
[2021-10-19 14:39:20,762 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,762 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:20,763 INFO  L254   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]
[2021-10-19 14:39:20,763 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-19 14:39:20,763 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:20,763 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:20,763 INFO  L82        PathProgramCache]: Analyzing trace with hash 1353465371, now seen corresponding path program 1 times
[2021-10-19 14:39:20,763 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:20,763 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525447209]
[2021-10-19 14:39:20,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:20,764 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:20,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:20,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:20,876 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:20,876 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525447209]
[2021-10-19 14:39:20,876 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525447209] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:20,876 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:20,876 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-19 14:39:20,876 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945631913]
[2021-10-19 14:39:20,876 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-19 14:39:20,876 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:20,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-19 14:39:20,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2021-10-19 14:39:20,879 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 557 out of 690
[2021-10-19 14:39:20,881 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 603 transitions, 1216 flow. Second operand  has 6 states, 6 states have (on average 558.8333333333334) internal successors, (3353), 6 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:20,881 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:20,881 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 690
[2021-10-19 14:39:20,881 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:27,139 INFO  L129       PetriNetUnfolder]: 13639/50113 cut-off events.
[2021-10-19 14:39:27,140 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:27,280 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 69552 conditions, 50113 events. 13639/50113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 616842 event pairs, 12240 based on Foata normal form. 0/41093 useless extension candidates. Maximal degree in co-relation 69517. Up to 19421 conditions per place. 
[2021-10-19 14:39:27,500 INFO  L132   encePairwiseOnDemand]: 678/690 looper letters, 100 selfloop transitions, 10 changer transitions 0/601 dead transitions.
[2021-10-19 14:39:27,500 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 601 transitions, 1432 flow
[2021-10-19 14:39:27,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-10-19 14:39:27,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-10-19 14:39:27,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3454 transitions.
[2021-10-19 14:39:27,505 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8342995169082126
[2021-10-19 14:39:27,505 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 3454 transitions.
[2021-10-19 14:39:27,505 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 3454 transitions.
[2021-10-19 14:39:27,507 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:27,507 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3454 transitions.
[2021-10-19 14:39:27,510 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 575.6666666666666) internal successors, (3454), 6 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,514 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,515 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,515 INFO  L186             Difference]: Start difference. First operand has 595 places, 603 transitions, 1216 flow. Second operand 6 states and 3454 transitions.
[2021-10-19 14:39:27,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 601 transitions, 1432 flow
[2021-10-19 14:39:27,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 601 transitions, 1428 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:27,523 INFO  L242             Difference]: Finished difference. Result has 596 places, 601 transitions, 1228 flow
[2021-10-19 14:39:27,524 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=596, PETRI_TRANSITIONS=601}
[2021-10-19 14:39:27,524 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -39 predicate places.
[2021-10-19 14:39:27,525 INFO  L470      AbstractCegarLoop]: Abstraction has has 596 places, 601 transitions, 1228 flow
[2021-10-19 14:39:27,526 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 558.8333333333334) internal successors, (3353), 6 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,526 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:27,526 INFO  L254   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]
[2021-10-19 14:39:27,526 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-19 14:39:27,526 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:27,527 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:27,527 INFO  L82        PathProgramCache]: Analyzing trace with hash -1613123310, now seen corresponding path program 1 times
[2021-10-19 14:39:27,527 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:27,527 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595310978]
[2021-10-19 14:39:27,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:27,527 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:27,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:27,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:27,552 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:27,552 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595310978]
[2021-10-19 14:39:27,552 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595310978] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:27,552 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:27,552 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:27,552 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985615951]
[2021-10-19 14:39:27,553 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:27,553 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:27,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:27,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:27,556 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 651 out of 690
[2021-10-19 14:39:27,557 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 601 transitions, 1228 flow. Second operand  has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,557 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:27,557 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 690
[2021-10-19 14:39:27,557 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:27,705 INFO  L129       PetriNetUnfolder]: 73/1598 cut-off events.
[2021-10-19 14:39:27,706 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:27,712 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 1598 events. 73/1598 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8108 event pairs, 36 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 1671. Up to 88 conditions per place. 
[2021-10-19 14:39:27,717 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 15 selfloop transitions, 2 changer transitions 0/600 dead transitions.
[2021-10-19 14:39:27,717 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 600 transitions, 1260 flow
[2021-10-19 14:39:27,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:27,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:27,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1971 transitions.
[2021-10-19 14:39:27,721 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9521739130434783
[2021-10-19 14:39:27,721 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1971 transitions.
[2021-10-19 14:39:27,721 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1971 transitions.
[2021-10-19 14:39:27,721 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:27,721 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1971 transitions.
[2021-10-19 14:39:27,724 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,726 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,726 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,726 INFO  L186             Difference]: Start difference. First operand has 596 places, 601 transitions, 1228 flow. Second operand 3 states and 1971 transitions.
[2021-10-19 14:39:27,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 600 transitions, 1260 flow
[2021-10-19 14:39:27,729 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 600 transitions, 1240 flow, removed 0 selfloop flow, removed 5 redundant places.
[2021-10-19 14:39:27,733 INFO  L242             Difference]: Finished difference. Result has 592 places, 600 transitions, 1210 flow
[2021-10-19 14:39:27,734 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=592, PETRI_TRANSITIONS=600}
[2021-10-19 14:39:27,734 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -43 predicate places.
[2021-10-19 14:39:27,734 INFO  L470      AbstractCegarLoop]: Abstraction has has 592 places, 600 transitions, 1210 flow
[2021-10-19 14:39:27,735 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,735 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:27,735 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:27,735 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-10-19 14:39:27,735 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:27,735 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:27,736 INFO  L82        PathProgramCache]: Analyzing trace with hash -1778059887, now seen corresponding path program 1 times
[2021-10-19 14:39:27,736 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:27,736 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806979582]
[2021-10-19 14:39:27,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:27,736 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:27,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:27,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:27,774 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:27,774 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806979582]
[2021-10-19 14:39:27,774 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806979582] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:27,774 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:27,774 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:27,774 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739686361]
[2021-10-19 14:39:27,775 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:27,775 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:27,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:27,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:27,776 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 557 out of 690
[2021-10-19 14:39:27,777 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 600 transitions, 1210 flow. Second operand  has 3 states, 3 states have (on average 559.6666666666666) internal successors, (1679), 3 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:27,778 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:27,778 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 690
[2021-10-19 14:39:27,778 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:33,516 INFO  L129       PetriNetUnfolder]: 13639/50110 cut-off events.
[2021-10-19 14:39:33,516 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:33,657 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 69547 conditions, 50110 events. 13639/50110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 616561 event pairs, 12240 based on Foata normal form. 0/41093 useless extension candidates. Maximal degree in co-relation 69512. Up to 19425 conditions per place. 
[2021-10-19 14:39:33,833 INFO  L132   encePairwiseOnDemand]: 684/690 looper letters, 104 selfloop transitions, 4 changer transitions 0/598 dead transitions.
[2021-10-19 14:39:33,833 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 598 transitions, 1422 flow
[2021-10-19 14:39:33,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:33,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:33,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1781 transitions.
[2021-10-19 14:39:33,836 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8603864734299517
[2021-10-19 14:39:33,836 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1781 transitions.
[2021-10-19 14:39:33,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1781 transitions.
[2021-10-19 14:39:33,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:33,837 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1781 transitions.
[2021-10-19 14:39:33,839 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:33,841 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:33,841 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:33,841 INFO  L186             Difference]: Start difference. First operand has 592 places, 600 transitions, 1210 flow. Second operand 3 states and 1781 transitions.
[2021-10-19 14:39:33,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 598 transitions, 1422 flow
[2021-10-19 14:39:33,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 598 transitions, 1418 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:33,852 INFO  L242             Difference]: Finished difference. Result has 590 places, 598 transitions, 1210 flow
[2021-10-19 14:39:33,853 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=590, PETRI_TRANSITIONS=598}
[2021-10-19 14:39:33,853 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -45 predicate places.
[2021-10-19 14:39:33,853 INFO  L470      AbstractCegarLoop]: Abstraction has has 590 places, 598 transitions, 1210 flow
[2021-10-19 14:39:33,853 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 559.6666666666666) internal successors, (1679), 3 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:33,853 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:33,853 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:33,854 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-19 14:39:33,854 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:33,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:33,854 INFO  L82        PathProgramCache]: Analyzing trace with hash 408433769, now seen corresponding path program 1 times
[2021-10-19 14:39:33,854 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:33,854 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661335849]
[2021-10-19 14:39:33,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:33,854 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:33,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:33,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:33,883 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:33,884 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661335849]
[2021-10-19 14:39:33,884 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661335849] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:33,884 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:33,884 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:33,884 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898707250]
[2021-10-19 14:39:33,884 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:33,884 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:33,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:33,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:33,887 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 657 out of 690
[2021-10-19 14:39:33,889 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 598 transitions, 1210 flow. Second operand  has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:33,889 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:33,889 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 690
[2021-10-19 14:39:33,889 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:34,108 INFO  L129       PetriNetUnfolder]: 38/997 cut-off events.
[2021-10-19 14:39:34,108 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:34,113 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 997 events. 38/997 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3659 event pairs, 9 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1016. Up to 28 conditions per place. 
[2021-10-19 14:39:34,116 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 9 selfloop transitions, 2 changer transitions 0/597 dead transitions.
[2021-10-19 14:39:34,116 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1230 flow
[2021-10-19 14:39:34,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:34,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:34,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1983 transitions.
[2021-10-19 14:39:34,119 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9579710144927536
[2021-10-19 14:39:34,120 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,120 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,121 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:34,121 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,125 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,127 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,127 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,127 INFO  L186             Difference]: Start difference. First operand has 590 places, 598 transitions, 1210 flow. Second operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1230 flow
[2021-10-19 14:39:34,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:34,135 INFO  L242             Difference]: Finished difference. Result has 589 places, 597 transitions, 1204 flow
[2021-10-19 14:39:34,136 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1204, PETRI_PLACES=589, PETRI_TRANSITIONS=597}
[2021-10-19 14:39:34,136 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -46 predicate places.
[2021-10-19 14:39:34,136 INFO  L470      AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1204 flow
[2021-10-19 14:39:34,137 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,137 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:34,137 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:34,137 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-10-19 14:39:34,137 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:34,137 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:34,137 INFO  L82        PathProgramCache]: Analyzing trace with hash -1358619462, now seen corresponding path program 1 times
[2021-10-19 14:39:34,138 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:34,138 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415156229]
[2021-10-19 14:39:34,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:34,138 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:34,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:34,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:34,171 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:34,171 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415156229]
[2021-10-19 14:39:34,173 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415156229] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:34,173 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:34,173 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:34,173 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148679973]
[2021-10-19 14:39:34,174 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:34,174 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:34,174 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:34,174 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:34,176 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 657 out of 690
[2021-10-19 14:39:34,177 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1204 flow. Second operand  has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,177 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:34,177 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 690
[2021-10-19 14:39:34,177 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:34,277 INFO  L129       PetriNetUnfolder]: 38/1014 cut-off events.
[2021-10-19 14:39:34,277 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:34,284 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1014 events. 38/1014 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3889 event pairs, 9 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1016. Up to 28 conditions per place. 
[2021-10-19 14:39:34,288 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 9 selfloop transitions, 2 changer transitions 0/596 dead transitions.
[2021-10-19 14:39:34,288 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 596 transitions, 1224 flow
[2021-10-19 14:39:34,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:34,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:34,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1983 transitions.
[2021-10-19 14:39:34,291 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9579710144927536
[2021-10-19 14:39:34,291 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,291 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,291 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:34,291 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,293 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,295 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,295 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,296 INFO  L186             Difference]: Start difference. First operand has 589 places, 597 transitions, 1204 flow. Second operand 3 states and 1983 transitions.
[2021-10-19 14:39:34,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 596 transitions, 1224 flow
[2021-10-19 14:39:34,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 596 transitions, 1220 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:34,303 INFO  L242             Difference]: Finished difference. Result has 588 places, 596 transitions, 1202 flow
[2021-10-19 14:39:34,304 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1202, PETRI_PLACES=588, PETRI_TRANSITIONS=596}
[2021-10-19 14:39:34,304 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -47 predicate places.
[2021-10-19 14:39:34,304 INFO  L470      AbstractCegarLoop]: Abstraction has has 588 places, 596 transitions, 1202 flow
[2021-10-19 14:39:34,305 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,305 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:34,305 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:34,305 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-19 14:39:34,305 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:34,305 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:34,306 INFO  L82        PathProgramCache]: Analyzing trace with hash 750830841, now seen corresponding path program 1 times
[2021-10-19 14:39:34,306 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:34,306 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170458517]
[2021-10-19 14:39:34,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:34,306 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:34,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:34,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:34,343 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:34,343 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170458517]
[2021-10-19 14:39:34,345 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170458517] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:34,345 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:34,345 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:34,345 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597012759]
[2021-10-19 14:39:34,346 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:34,346 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:34,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:34,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:34,348 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:34,349 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 596 transitions, 1202 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,349 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:34,349 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:34,349 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:34,478 INFO  L129       PetriNetUnfolder]: 49/1303 cut-off events.
[2021-10-19 14:39:34,478 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:34,483 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 1303 events. 49/1303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5563 event pairs, 12 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1319. Up to 40 conditions per place. 
[2021-10-19 14:39:34,487 INFO  L132   encePairwiseOnDemand]: 684/690 looper letters, 10 selfloop transitions, 2 changer transitions 0/594 dead transitions.
[2021-10-19 14:39:34,488 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 594 transitions, 1222 flow
[2021-10-19 14:39:34,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:34,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:34,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1978 transitions.
[2021-10-19 14:39:34,490 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9555555555555556
[2021-10-19 14:39:34,490 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:34,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.3333333333334) internal successors, (1978), 3 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,495 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,495 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,495 INFO  L186             Difference]: Start difference. First operand has 588 places, 596 transitions, 1202 flow. Second operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 594 transitions, 1222 flow
[2021-10-19 14:39:34,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:34,502 INFO  L242             Difference]: Finished difference. Result has 585 places, 594 transitions, 1204 flow
[2021-10-19 14:39:34,503 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1204, PETRI_PLACES=585, PETRI_TRANSITIONS=594}
[2021-10-19 14:39:34,503 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -50 predicate places.
[2021-10-19 14:39:34,503 INFO  L470      AbstractCegarLoop]: Abstraction has has 585 places, 594 transitions, 1204 flow
[2021-10-19 14:39:34,504 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,504 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:34,504 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:34,504 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-10-19 14:39:34,504 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:34,505 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:34,505 INFO  L82        PathProgramCache]: Analyzing trace with hash 1731318691, now seen corresponding path program 1 times
[2021-10-19 14:39:34,505 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:34,505 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985585542]
[2021-10-19 14:39:34,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:34,505 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:34,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:34,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:34,536 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:34,536 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985585542]
[2021-10-19 14:39:34,536 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985585542] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:34,536 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:34,536 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:34,536 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267923009]
[2021-10-19 14:39:34,537 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:34,537 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:34,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:34,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:34,538 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:34,540 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 594 transitions, 1204 flow. Second operand  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,540 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:34,540 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:34,540 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:34,666 INFO  L129       PetriNetUnfolder]: 54/1423 cut-off events.
[2021-10-19 14:39:34,666 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:34,672 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 1423 events. 54/1423 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6755 event pairs, 12 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 1446. Up to 42 conditions per place. 
[2021-10-19 14:39:34,676 INFO  L132   encePairwiseOnDemand]: 684/690 looper letters, 10 selfloop transitions, 2 changer transitions 0/592 dead transitions.
[2021-10-19 14:39:34,676 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 592 transitions, 1224 flow
[2021-10-19 14:39:34,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:34,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:34,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1978 transitions.
[2021-10-19 14:39:34,679 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9555555555555556
[2021-10-19 14:39:34,679 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,679 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:34,679 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 659.3333333333334) internal successors, (1978), 3 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,683 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,683 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,683 INFO  L186             Difference]: Start difference. First operand has 585 places, 594 transitions, 1204 flow. Second operand 3 states and 1978 transitions.
[2021-10-19 14:39:34,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 592 transitions, 1224 flow
[2021-10-19 14:39:34,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 592 transitions, 1224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:39:34,692 INFO  L242             Difference]: Finished difference. Result has 584 places, 592 transitions, 1210 flow
[2021-10-19 14:39:34,692 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=584, PETRI_TRANSITIONS=592}
[2021-10-19 14:39:34,692 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -51 predicate places.
[2021-10-19 14:39:34,692 INFO  L470      AbstractCegarLoop]: Abstraction has has 584 places, 592 transitions, 1210 flow
[2021-10-19 14:39:34,693 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,693 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:34,693 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:34,693 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-10-19 14:39:34,693 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:34,694 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:34,694 INFO  L82        PathProgramCache]: Analyzing trace with hash 674912287, now seen corresponding path program 1 times
[2021-10-19 14:39:34,694 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:34,694 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899203197]
[2021-10-19 14:39:34,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:34,694 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:34,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:34,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:34,758 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:34,758 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899203197]
[2021-10-19 14:39:34,758 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899203197] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:34,758 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:34,758 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-10-19 14:39:34,758 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44358518]
[2021-10-19 14:39:34,759 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-10-19 14:39:34,759 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:34,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-19 14:39:34,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-10-19 14:39:34,762 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 586 out of 690
[2021-10-19 14:39:34,764 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 592 transitions, 1210 flow. Second operand  has 7 states, 7 states have (on average 590.4285714285714) internal successors, (4133), 7 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:34,764 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:34,764 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 690
[2021-10-19 14:39:34,764 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:35,804 INFO  L129       PetriNetUnfolder]: 914/7786 cut-off events.
[2021-10-19 14:39:35,804 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-19 14:39:35,833 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 9359 conditions, 7786 events. 914/7786 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 75811 event pairs, 648 based on Foata normal form. 0/6545 useless extension candidates. Maximal degree in co-relation 9320. Up to 766 conditions per place. 
[2021-10-19 14:39:35,852 INFO  L132   encePairwiseOnDemand]: 680/690 looper letters, 154 selfloop transitions, 9 changer transitions 0/674 dead transitions.
[2021-10-19 14:39:35,853 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 674 transitions, 1700 flow
[2021-10-19 14:39:35,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-10-19 14:39:35,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-10-19 14:39:35,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4852 transitions.
[2021-10-19 14:39:35,860 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8789855072463768
[2021-10-19 14:39:35,860 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 4852 transitions.
[2021-10-19 14:39:35,860 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 4852 transitions.
[2021-10-19 14:39:35,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:35,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 4852 transitions.
[2021-10-19 14:39:35,865 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 606.5) internal successors, (4852), 8 states have internal predecessors, (4852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:35,871 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 690.0) internal successors, (6210), 9 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:35,872 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 690.0) internal successors, (6210), 9 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:35,872 INFO  L186             Difference]: Start difference. First operand has 584 places, 592 transitions, 1210 flow. Second operand 8 states and 4852 transitions.
[2021-10-19 14:39:35,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 674 transitions, 1700 flow
[2021-10-19 14:39:35,875 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 674 transitions, 1700 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:39:35,879 INFO  L242             Difference]: Finished difference. Result has 596 places, 598 transitions, 1267 flow
[2021-10-19 14:39:35,880 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1267, PETRI_PLACES=596, PETRI_TRANSITIONS=598}
[2021-10-19 14:39:35,880 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -39 predicate places.
[2021-10-19 14:39:35,880 INFO  L470      AbstractCegarLoop]: Abstraction has has 596 places, 598 transitions, 1267 flow
[2021-10-19 14:39:35,881 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 590.4285714285714) internal successors, (4133), 7 states have internal predecessors, (4133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:35,881 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:35,881 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:35,881 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-10-19 14:39:35,881 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:35,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:35,882 INFO  L82        PathProgramCache]: Analyzing trace with hash -1625364304, now seen corresponding path program 1 times
[2021-10-19 14:39:35,882 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:35,882 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109510828]
[2021-10-19 14:39:35,882 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:35,882 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:35,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:36,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:36,008 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:36,008 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109510828]
[2021-10-19 14:39:36,009 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109510828] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:36,009 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:36,009 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-19 14:39:36,009 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732012267]
[2021-10-19 14:39:36,009 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-19 14:39:36,009 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:36,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-19 14:39:36,010 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2021-10-19 14:39:36,012 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 565 out of 690
[2021-10-19 14:39:36,014 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 598 transitions, 1267 flow. Second operand  has 6 states, 6 states have (on average 567.3333333333334) internal successors, (3404), 6 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:36,014 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:36,014 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 690
[2021-10-19 14:39:36,014 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:50,141 INFO  L129       PetriNetUnfolder]: 29718/106642 cut-off events.
[2021-10-19 14:39:50,147 INFO  L130       PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2021-10-19 14:39:50,722 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 149638 conditions, 106642 events. 29718/106642 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 1455760 event pairs, 12174 based on Foata normal form. 0/90642 useless extension candidates. Maximal degree in co-relation 149593. Up to 40598 conditions per place. 
[2021-10-19 14:39:51,101 INFO  L132   encePairwiseOnDemand]: 678/690 looper letters, 165 selfloop transitions, 8 changer transitions 0/670 dead transitions.
[2021-10-19 14:39:51,101 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 670 transitions, 1757 flow
[2021-10-19 14:39:51,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-10-19 14:39:51,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-10-19 14:39:51,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3566 transitions.
[2021-10-19 14:39:51,122 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8613526570048309
[2021-10-19 14:39:51,123 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 3566 transitions.
[2021-10-19 14:39:51,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 3566 transitions.
[2021-10-19 14:39:51,123 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:51,123 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3566 transitions.
[2021-10-19 14:39:51,127 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 594.3333333333334) internal successors, (3566), 6 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:51,131 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:51,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:51,132 INFO  L186             Difference]: Start difference. First operand has 596 places, 598 transitions, 1267 flow. Second operand 6 states and 3566 transitions.
[2021-10-19 14:39:51,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 670 transitions, 1757 flow
[2021-10-19 14:39:51,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 670 transitions, 1752 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:39:51,159 INFO  L242             Difference]: Finished difference. Result has 599 places, 602 transitions, 1316 flow
[2021-10-19 14:39:51,160 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1316, PETRI_PLACES=599, PETRI_TRANSITIONS=602}
[2021-10-19 14:39:51,160 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -36 predicate places.
[2021-10-19 14:39:51,160 INFO  L470      AbstractCegarLoop]: Abstraction has has 599 places, 602 transitions, 1316 flow
[2021-10-19 14:39:51,161 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 567.3333333333334) internal successors, (3404), 6 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:51,161 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:51,161 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:51,161 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-10-19 14:39:51,161 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:51,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:51,162 INFO  L82        PathProgramCache]: Analyzing trace with hash -1347772023, now seen corresponding path program 1 times
[2021-10-19 14:39:51,162 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:51,162 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112113439]
[2021-10-19 14:39:51,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:51,162 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:51,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:51,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:51,288 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:51,288 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112113439]
[2021-10-19 14:39:51,288 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112113439] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:51,288 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:51,289 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-19 14:39:51,289 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801951846]
[2021-10-19 14:39:51,289 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-19 14:39:51,290 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:51,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-19 14:39:51,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2021-10-19 14:39:51,292 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 573 out of 690
[2021-10-19 14:39:51,299 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 602 transitions, 1316 flow. Second operand  has 6 states, 6 states have (on average 574.5) internal successors, (3447), 6 states have internal predecessors, (3447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:51,299 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:51,299 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 573 of 690
[2021-10-19 14:39:51,299 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:59,153 INFO  L129       PetriNetUnfolder]: 23012/58650 cut-off events.
[2021-10-19 14:39:59,154 INFO  L130       PetriNetUnfolder]: For 3820/3820 co-relation queries the response was YES.
[2021-10-19 14:39:59,432 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 97764 conditions, 58650 events. 23012/58650 cut-off events. For 3820/3820 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 654042 event pairs, 4578 based on Foata normal form. 0/51138 useless extension candidates. Maximal degree in co-relation 97717. Up to 10916 conditions per place. 
[2021-10-19 14:39:59,611 INFO  L132   encePairwiseOnDemand]: 685/690 looper letters, 345 selfloop transitions, 4 changer transitions 0/857 dead transitions.
[2021-10-19 14:39:59,612 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 857 transitions, 2708 flow
[2021-10-19 14:39:59,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-10-19 14:39:59,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-10-19 14:39:59,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3748 transitions.
[2021-10-19 14:39:59,617 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9053140096618357
[2021-10-19 14:39:59,617 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 3748 transitions.
[2021-10-19 14:39:59,617 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 3748 transitions.
[2021-10-19 14:39:59,617 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:59,618 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3748 transitions.
[2021-10-19 14:39:59,621 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 624.6666666666666) internal successors, (3748), 6 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,625 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,626 INFO  L186             Difference]: Start difference. First operand has 599 places, 602 transitions, 1316 flow. Second operand 6 states and 3748 transitions.
[2021-10-19 14:39:59,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 857 transitions, 2708 flow
[2021-10-19 14:39:59,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 857 transitions, 2708 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:39:59,637 INFO  L242             Difference]: Finished difference. Result has 603 places, 601 transitions, 1322 flow
[2021-10-19 14:39:59,638 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=603, PETRI_TRANSITIONS=601}
[2021-10-19 14:39:59,638 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -32 predicate places.
[2021-10-19 14:39:59,638 INFO  L470      AbstractCegarLoop]: Abstraction has has 603 places, 601 transitions, 1322 flow
[2021-10-19 14:39:59,639 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 574.5) internal successors, (3447), 6 states have internal predecessors, (3447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,639 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:59,639 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:59,639 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-10-19 14:39:59,639 INFO  L402      AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:59,640 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:59,640 INFO  L82        PathProgramCache]: Analyzing trace with hash -1308571789, now seen corresponding path program 1 times
[2021-10-19 14:39:59,640 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:59,640 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892365787]
[2021-10-19 14:39:59,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:59,640 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:59,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:39:59,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:39:59,664 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:39:59,664 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892365787]
[2021-10-19 14:39:59,664 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892365787] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:39:59,665 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:39:59,665 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:39:59,665 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909293855]
[2021-10-19 14:39:59,665 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:39:59,665 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:39:59,665 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:39:59,665 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:39:59,667 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:39:59,667 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 601 transitions, 1322 flow. Second operand  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,667 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:39:59,668 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:39:59,668 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:39:59,920 INFO  L129       PetriNetUnfolder]: 88/2486 cut-off events.
[2021-10-19 14:39:59,920 INFO  L130       PetriNetUnfolder]: For 16/22 co-relation queries the response was YES.
[2021-10-19 14:39:59,936 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 2486 events. 88/2486 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17432 event pairs, 0 based on Foata normal form. 0/2186 useless extension candidates. Maximal degree in co-relation 2638. Up to 33 conditions per place. 
[2021-10-19 14:39:59,940 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 11 selfloop transitions, 2 changer transitions 0/600 dead transitions.
[2021-10-19 14:39:59,940 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 600 transitions, 1346 flow
[2021-10-19 14:39:59,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:39:59,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:39:59,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions.
[2021-10-19 14:39:59,943 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9545893719806763
[2021-10-19 14:39:59,943 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions.
[2021-10-19 14:39:59,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions.
[2021-10-19 14:39:59,944 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:39:59,944 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions.
[2021-10-19 14:39:59,945 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,947 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,947 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,947 INFO  L186             Difference]: Start difference. First operand has 603 places, 601 transitions, 1322 flow. Second operand 3 states and 1976 transitions.
[2021-10-19 14:39:59,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 600 transitions, 1346 flow
[2021-10-19 14:39:59,950 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 600 transitions, 1339 flow, removed 0 selfloop flow, removed 4 redundant places.
[2021-10-19 14:39:59,955 INFO  L242             Difference]: Finished difference. Result has 600 places, 600 transitions, 1317 flow
[2021-10-19 14:39:59,955 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=600, PETRI_TRANSITIONS=600}
[2021-10-19 14:39:59,955 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -35 predicate places.
[2021-10-19 14:39:59,955 INFO  L470      AbstractCegarLoop]: Abstraction has has 600 places, 600 transitions, 1317 flow
[2021-10-19 14:39:59,956 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:39:59,956 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:39:59,956 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:39:59,956 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-10-19 14:39:59,956 INFO  L402      AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:39:59,957 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:39:59,957 INFO  L82        PathProgramCache]: Analyzing trace with hash 1286617114, now seen corresponding path program 1 times
[2021-10-19 14:39:59,957 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:39:59,957 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542251658]
[2021-10-19 14:39:59,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:39:59,957 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:39:59,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:00,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:00,031 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:00,031 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542251658]
[2021-10-19 14:40:00,031 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542251658] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:00,031 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:00,031 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-19 14:40:00,032 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058870181]
[2021-10-19 14:40:00,033 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-19 14:40:00,033 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:00,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-19 14:40:00,035 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2021-10-19 14:40:00,037 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 565 out of 690
[2021-10-19 14:40:00,038 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 600 transitions, 1317 flow. Second operand  has 6 states, 6 states have (on average 567.3333333333334) internal successors, (3404), 6 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:00,038 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:00,038 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 690
[2021-10-19 14:40:00,038 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:11,054 INFO  L129       PetriNetUnfolder]: 22364/84754 cut-off events.
[2021-10-19 14:40:11,055 INFO  L130       PetriNetUnfolder]: For 3147/3147 co-relation queries the response was YES.
[2021-10-19 14:40:11,577 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 122580 conditions, 84754 events. 22364/84754 cut-off events. For 3147/3147 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 1138981 event pairs, 6260 based on Foata normal form. 0/74946 useless extension candidates. Maximal degree in co-relation 122532. Up to 30486 conditions per place. 
[2021-10-19 14:40:11,799 INFO  L132   encePairwiseOnDemand]: 678/690 looper letters, 160 selfloop transitions, 8 changer transitions 0/664 dead transitions.
[2021-10-19 14:40:11,800 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 664 transitions, 1845 flow
[2021-10-19 14:40:11,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-10-19 14:40:11,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-10-19 14:40:11,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3553 transitions.
[2021-10-19 14:40:11,804 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8582125603864734
[2021-10-19 14:40:11,804 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 3553 transitions.
[2021-10-19 14:40:11,804 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 3553 transitions.
[2021-10-19 14:40:11,805 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:11,805 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3553 transitions.
[2021-10-19 14:40:11,809 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 592.1666666666666) internal successors, (3553), 6 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:11,813 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:11,813 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 690.0) internal successors, (4830), 7 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:11,813 INFO  L186             Difference]: Start difference. First operand has 600 places, 600 transitions, 1317 flow. Second operand 6 states and 3553 transitions.
[2021-10-19 14:40:11,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 664 transitions, 1845 flow
[2021-10-19 14:40:11,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 664 transitions, 1841 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:11,826 INFO  L242             Difference]: Finished difference. Result has 603 places, 604 transitions, 1367 flow
[2021-10-19 14:40:11,826 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1367, PETRI_PLACES=603, PETRI_TRANSITIONS=604}
[2021-10-19 14:40:11,827 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -32 predicate places.
[2021-10-19 14:40:11,827 INFO  L470      AbstractCegarLoop]: Abstraction has has 603 places, 604 transitions, 1367 flow
[2021-10-19 14:40:11,827 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 567.3333333333334) internal successors, (3404), 6 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:11,827 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:11,827 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:11,827 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-10-19 14:40:11,827 INFO  L402      AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:11,828 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:11,828 INFO  L82        PathProgramCache]: Analyzing trace with hash -1905311843, now seen corresponding path program 1 times
[2021-10-19 14:40:11,828 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:11,828 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168603184]
[2021-10-19 14:40:11,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:11,828 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:11,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:11,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:11,867 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:11,867 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168603184]
[2021-10-19 14:40:11,867 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168603184] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:11,867 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:11,867 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:11,867 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761796684]
[2021-10-19 14:40:11,867 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:11,867 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:11,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:11,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:11,869 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:40:11,870 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 604 transitions, 1367 flow. Second operand  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:11,870 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:11,870 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:40:11,870 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:12,302 INFO  L129       PetriNetUnfolder]: 128/3434 cut-off events.
[2021-10-19 14:40:12,302 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:12,322 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 3434 events. 128/3434 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 28597 event pairs, 0 based on Foata normal form. 0/3022 useless extension candidates. Maximal degree in co-relation 3716. Up to 81 conditions per place. 
[2021-10-19 14:40:12,328 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 11 selfloop transitions, 2 changer transitions 0/603 dead transitions.
[2021-10-19 14:40:12,328 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 603 transitions, 1391 flow
[2021-10-19 14:40:12,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:12,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:12,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions.
[2021-10-19 14:40:12,331 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9545893719806763
[2021-10-19 14:40:12,331 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,331 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,331 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:12,331 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,333 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,334 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,334 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,334 INFO  L186             Difference]: Start difference. First operand has 603 places, 604 transitions, 1367 flow. Second operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 603 transitions, 1391 flow
[2021-10-19 14:40:12,338 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 603 transitions, 1391 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:40:12,342 INFO  L242             Difference]: Finished difference. Result has 604 places, 603 transitions, 1369 flow
[2021-10-19 14:40:12,343 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1369, PETRI_PLACES=604, PETRI_TRANSITIONS=603}
[2021-10-19 14:40:12,343 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -31 predicate places.
[2021-10-19 14:40:12,343 INFO  L470      AbstractCegarLoop]: Abstraction has has 604 places, 603 transitions, 1369 flow
[2021-10-19 14:40:12,343 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,343 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:12,344 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:12,344 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2021-10-19 14:40:12,344 INFO  L402      AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:12,344 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:12,344 INFO  L82        PathProgramCache]: Analyzing trace with hash 589571039, now seen corresponding path program 1 times
[2021-10-19 14:40:12,344 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:12,344 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106303324]
[2021-10-19 14:40:12,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:12,344 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:12,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:12,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:12,370 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:12,370 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106303324]
[2021-10-19 14:40:12,370 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106303324] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:12,371 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:12,371 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:12,371 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838786805]
[2021-10-19 14:40:12,371 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:12,371 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:12,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:12,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:12,373 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:40:12,373 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 603 transitions, 1369 flow. Second operand  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,373 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:12,373 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:40:12,373 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:12,711 INFO  L129       PetriNetUnfolder]: 128/3422 cut-off events.
[2021-10-19 14:40:12,711 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:12,730 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3798 conditions, 3422 events. 128/3422 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 28437 event pairs, 0 based on Foata normal form. 0/3022 useless extension candidates. Maximal degree in co-relation 3748. Up to 101 conditions per place. 
[2021-10-19 14:40:12,736 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 11 selfloop transitions, 2 changer transitions 0/602 dead transitions.
[2021-10-19 14:40:12,736 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 602 transitions, 1393 flow
[2021-10-19 14:40:12,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:12,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:12,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions.
[2021-10-19 14:40:12,739 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9545893719806763
[2021-10-19 14:40:12,739 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,739 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,739 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:12,739 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,741 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,742 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,742 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,742 INFO  L186             Difference]: Start difference. First operand has 604 places, 603 transitions, 1369 flow. Second operand 3 states and 1976 transitions.
[2021-10-19 14:40:12,742 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 602 transitions, 1393 flow
[2021-10-19 14:40:12,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 602 transitions, 1389 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:12,750 INFO  L242             Difference]: Finished difference. Result has 603 places, 602 transitions, 1367 flow
[2021-10-19 14:40:12,750 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1367, PETRI_PLACES=603, PETRI_TRANSITIONS=602}
[2021-10-19 14:40:12,750 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -32 predicate places.
[2021-10-19 14:40:12,751 INFO  L470      AbstractCegarLoop]: Abstraction has has 603 places, 602 transitions, 1367 flow
[2021-10-19 14:40:12,751 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,751 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:12,751 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:12,751 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2021-10-19 14:40:12,751 INFO  L402      AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:12,751 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:12,752 INFO  L82        PathProgramCache]: Analyzing trace with hash -309161630, now seen corresponding path program 1 times
[2021-10-19 14:40:12,752 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:12,752 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235753540]
[2021-10-19 14:40:12,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:12,752 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:12,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:12,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:12,777 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:12,777 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235753540]
[2021-10-19 14:40:12,777 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235753540] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:12,777 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:12,777 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:12,777 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793777632]
[2021-10-19 14:40:12,778 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:12,778 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:12,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:12,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:12,779 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 660 out of 690
[2021-10-19 14:40:12,780 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 602 transitions, 1367 flow. Second operand  has 3 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:12,780 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:12,780 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 690
[2021-10-19 14:40:12,780 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:13,399 INFO  L129       PetriNetUnfolder]: 182/4922 cut-off events.
[2021-10-19 14:40:13,400 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:13,431 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5262 conditions, 4922 events. 182/4922 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 45919 event pairs, 4 based on Foata normal form. 0/4350 useless extension candidates. Maximal degree in co-relation 5212. Up to 64 conditions per place. 
[2021-10-19 14:40:13,439 INFO  L132   encePairwiseOnDemand]: 686/690 looper letters, 6 selfloop transitions, 2 changer transitions 0/602 dead transitions.
[2021-10-19 14:40:13,439 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 602 transitions, 1383 flow
[2021-10-19 14:40:13,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:13,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:13,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1990 transitions.
[2021-10-19 14:40:13,441 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.961352657004831
[2021-10-19 14:40:13,441 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1990 transitions.
[2021-10-19 14:40:13,441 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1990 transitions.
[2021-10-19 14:40:13,442 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:13,442 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1990 transitions.
[2021-10-19 14:40:13,443 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 663.3333333333334) internal successors, (1990), 3 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:13,445 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:13,445 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:13,445 INFO  L186             Difference]: Start difference. First operand has 603 places, 602 transitions, 1367 flow. Second operand 3 states and 1990 transitions.
[2021-10-19 14:40:13,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 602 transitions, 1383 flow
[2021-10-19 14:40:13,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 602 transitions, 1379 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:13,457 INFO  L242             Difference]: Finished difference. Result has 602 places, 602 transitions, 1373 flow
[2021-10-19 14:40:13,458 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1373, PETRI_PLACES=602, PETRI_TRANSITIONS=602}
[2021-10-19 14:40:13,458 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -33 predicate places.
[2021-10-19 14:40:13,458 INFO  L470      AbstractCegarLoop]: Abstraction has has 602 places, 602 transitions, 1373 flow
[2021-10-19 14:40:13,458 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:13,458 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:13,459 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:13,459 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2021-10-19 14:40:13,459 INFO  L402      AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:13,459 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:13,459 INFO  L82        PathProgramCache]: Analyzing trace with hash -1571848439, now seen corresponding path program 1 times
[2021-10-19 14:40:13,459 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:13,459 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241725292]
[2021-10-19 14:40:13,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:13,459 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:13,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:13,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:13,500 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:13,500 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241725292]
[2021-10-19 14:40:13,500 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241725292] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:13,500 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:13,500 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:13,500 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628211281]
[2021-10-19 14:40:13,501 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:13,501 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:13,501 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:13,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:13,502 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:40:13,503 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 602 transitions, 1373 flow. Second operand  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:13,503 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:13,503 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:40:13,503 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:14,058 INFO  L129       PetriNetUnfolder]: 162/4514 cut-off events.
[2021-10-19 14:40:14,058 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:14,092 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5022 conditions, 4514 events. 162/4514 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 41742 event pairs, 0 based on Foata normal form. 0/4008 useless extension candidates. Maximal degree in co-relation 4972. Up to 185 conditions per place. 
[2021-10-19 14:40:14,100 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 11 selfloop transitions, 2 changer transitions 0/601 dead transitions.
[2021-10-19 14:40:14,100 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 601 transitions, 1397 flow
[2021-10-19 14:40:14,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:14,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:14,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions.
[2021-10-19 14:40:14,102 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9545893719806763
[2021-10-19 14:40:14,102 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:14,102 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:14,102 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:14,103 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:14,113 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:14,114 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:14,114 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:14,114 INFO  L186             Difference]: Start difference. First operand has 602 places, 602 transitions, 1373 flow. Second operand 3 states and 1976 transitions.
[2021-10-19 14:40:14,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 601 transitions, 1397 flow
[2021-10-19 14:40:14,117 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1397 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:40:14,122 INFO  L242             Difference]: Finished difference. Result has 603 places, 601 transitions, 1375 flow
[2021-10-19 14:40:14,122 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1375, PETRI_PLACES=603, PETRI_TRANSITIONS=601}
[2021-10-19 14:40:14,122 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -32 predicate places.
[2021-10-19 14:40:14,122 INFO  L470      AbstractCegarLoop]: Abstraction has has 603 places, 601 transitions, 1375 flow
[2021-10-19 14:40:14,123 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:14,123 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:14,123 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:14,123 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2021-10-19 14:40:14,123 INFO  L402      AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:14,124 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:14,124 INFO  L82        PathProgramCache]: Analyzing trace with hash 790721642, now seen corresponding path program 1 times
[2021-10-19 14:40:14,124 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:14,124 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782137835]
[2021-10-19 14:40:14,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:14,124 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:14,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:14,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:14,170 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:14,170 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782137835]
[2021-10-19 14:40:14,170 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782137835] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:14,170 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:14,171 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:14,171 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667106619]
[2021-10-19 14:40:14,171 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:14,171 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:14,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:14,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:14,172 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 565 out of 690
[2021-10-19 14:40:14,173 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 601 transitions, 1375 flow. Second operand  has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:14,173 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:14,173 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 690
[2021-10-19 14:40:14,173 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:27,515 INFO  L129       PetriNetUnfolder]: 25032/101032 cut-off events.
[2021-10-19 14:40:27,516 INFO  L130       PetriNetUnfolder]: For 6947/6947 co-relation queries the response was YES.
[2021-10-19 14:40:28,506 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 147555 conditions, 101032 events. 25032/101032 cut-off events. For 6947/6947 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 1457308 event pairs, 6804 based on Foata normal form. 0/90428 useless extension candidates. Maximal degree in co-relation 147501. Up to 23130 conditions per place. 
[2021-10-19 14:40:28,764 INFO  L132   encePairwiseOnDemand]: 686/690 looper letters, 149 selfloop transitions, 2 changer transitions 0/644 dead transitions.
[2021-10-19 14:40:28,764 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 644 transitions, 1796 flow
[2021-10-19 14:40:28,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:28,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:28,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions.
[2021-10-19 14:40:28,766 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8845410628019323
[2021-10-19 14:40:28,766 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions.
[2021-10-19 14:40:28,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions.
[2021-10-19 14:40:28,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:28,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions.
[2021-10-19 14:40:28,768 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:28,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:28,769 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:28,769 INFO  L186             Difference]: Start difference. First operand has 603 places, 601 transitions, 1375 flow. Second operand 3 states and 1831 transitions.
[2021-10-19 14:40:28,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 644 transitions, 1796 flow
[2021-10-19 14:40:28,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 644 transitions, 1792 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:28,790 INFO  L242             Difference]: Finished difference. Result has 602 places, 601 transitions, 1381 flow
[2021-10-19 14:40:28,790 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1381, PETRI_PLACES=602, PETRI_TRANSITIONS=601}
[2021-10-19 14:40:28,790 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -33 predicate places.
[2021-10-19 14:40:28,790 INFO  L470      AbstractCegarLoop]: Abstraction has has 602 places, 601 transitions, 1381 flow
[2021-10-19 14:40:28,791 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:28,791 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:28,791 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:28,791 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2021-10-19 14:40:28,791 INFO  L402      AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:28,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:28,791 INFO  L82        PathProgramCache]: Analyzing trace with hash -466668212, now seen corresponding path program 1 times
[2021-10-19 14:40:28,792 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:28,792 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171254803]
[2021-10-19 14:40:28,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:28,792 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:28,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:28,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:28,820 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:28,820 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171254803]
[2021-10-19 14:40:28,820 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171254803] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:28,820 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:28,820 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:28,820 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714045706]
[2021-10-19 14:40:28,820 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:28,820 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:28,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:28,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:28,822 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 660 out of 690
[2021-10-19 14:40:28,823 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 601 transitions, 1381 flow. Second operand  has 3 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:28,823 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:28,823 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 690
[2021-10-19 14:40:28,823 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:29,611 INFO  L129       PetriNetUnfolder]: 224/6276 cut-off events.
[2021-10-19 14:40:29,611 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:29,664 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6705 conditions, 6276 events. 224/6276 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 64085 event pairs, 4 based on Foata normal form. 0/5594 useless extension candidates. Maximal degree in co-relation 6654. Up to 64 conditions per place. 
[2021-10-19 14:40:29,678 INFO  L132   encePairwiseOnDemand]: 686/690 looper letters, 6 selfloop transitions, 2 changer transitions 0/601 dead transitions.
[2021-10-19 14:40:29,678 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 601 transitions, 1397 flow
[2021-10-19 14:40:29,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:29,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:29,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1990 transitions.
[2021-10-19 14:40:29,680 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.961352657004831
[2021-10-19 14:40:29,680 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1990 transitions.
[2021-10-19 14:40:29,680 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1990 transitions.
[2021-10-19 14:40:29,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:29,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1990 transitions.
[2021-10-19 14:40:29,856 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 663.3333333333334) internal successors, (1990), 3 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:29,858 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:29,858 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:29,858 INFO  L186             Difference]: Start difference. First operand has 602 places, 601 transitions, 1381 flow. Second operand 3 states and 1990 transitions.
[2021-10-19 14:40:29,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 601 transitions, 1397 flow
[2021-10-19 14:40:29,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 601 transitions, 1397 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:40:29,865 INFO  L242             Difference]: Finished difference. Result has 603 places, 601 transitions, 1391 flow
[2021-10-19 14:40:29,866 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1391, PETRI_PLACES=603, PETRI_TRANSITIONS=601}
[2021-10-19 14:40:29,866 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -32 predicate places.
[2021-10-19 14:40:29,866 INFO  L470      AbstractCegarLoop]: Abstraction has has 603 places, 601 transitions, 1391 flow
[2021-10-19 14:40:29,866 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:29,866 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:29,867 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:29,867 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2021-10-19 14:40:29,867 INFO  L402      AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:29,867 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:29,867 INFO  L82        PathProgramCache]: Analyzing trace with hash 544549100, now seen corresponding path program 1 times
[2021-10-19 14:40:29,867 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:29,867 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831892762]
[2021-10-19 14:40:29,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:29,867 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:29,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:29,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:29,898 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:29,898 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831892762]
[2021-10-19 14:40:29,898 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831892762] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:29,898 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:29,898 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-19 14:40:29,898 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589979558]
[2021-10-19 14:40:29,899 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:29,899 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:29,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:29,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:29,900 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 661 out of 690
[2021-10-19 14:40:29,901 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 601 transitions, 1391 flow. Second operand  has 3 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:29,901 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:29,901 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 690
[2021-10-19 14:40:29,901 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:30,670 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][581], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, 677#(= |#race~id_3~0| 0), Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 821#true])
[2021-10-19 14:40:30,670 INFO  L384   tUnfolder$Statistics]: this new event has 376 ancestors and is not cut-off event
[2021-10-19 14:40:30,670 INFO  L387   tUnfolder$Statistics]:   existing Event has 398 ancestors and is not cut-off event
[2021-10-19 14:40:30,670 INFO  L387   tUnfolder$Statistics]:   existing Event has 406 ancestors and is not cut-off event
[2021-10-19 14:40:30,670 INFO  L387   tUnfolder$Statistics]:   existing Event has 384 ancestors and is not cut-off event
[2021-10-19 14:40:30,673 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][581], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, 677#(= |#race~id_3~0| 0), Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), 743#(<= 2147483647 ~id_0~0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 821#true])
[2021-10-19 14:40:30,673 INFO  L384   tUnfolder$Statistics]: this new event has 387 ancestors and is not cut-off event
[2021-10-19 14:40:30,673 INFO  L387   tUnfolder$Statistics]:   existing Event has 395 ancestors and is not cut-off event
[2021-10-19 14:40:30,673 INFO  L387   tUnfolder$Statistics]:   existing Event has 409 ancestors and is not cut-off event
[2021-10-19 14:40:30,673 INFO  L387   tUnfolder$Statistics]:   existing Event has 417 ancestors and is not cut-off event
[2021-10-19 14:40:30,675 INFO  L129       PetriNetUnfolder]: 170/5734 cut-off events.
[2021-10-19 14:40:30,675 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:30,725 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 5734 events. 170/5734 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 56394 event pairs, 0 based on Foata normal form. 0/5168 useless extension candidates. Maximal degree in co-relation 6224. Up to 95 conditions per place. 
[2021-10-19 14:40:30,736 INFO  L132   encePairwiseOnDemand]: 686/690 looper letters, 7 selfloop transitions, 3 changer transitions 0/603 dead transitions.
[2021-10-19 14:40:30,736 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 603 transitions, 1415 flow
[2021-10-19 14:40:30,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:30,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:30,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1994 transitions.
[2021-10-19 14:40:30,738 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9632850241545894
[2021-10-19 14:40:30,738 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1994 transitions.
[2021-10-19 14:40:30,738 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1994 transitions.
[2021-10-19 14:40:30,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:30,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1994 transitions.
[2021-10-19 14:40:30,740 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 664.6666666666666) internal successors, (1994), 3 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:30,741 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:30,741 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:30,741 INFO  L186             Difference]: Start difference. First operand has 603 places, 601 transitions, 1391 flow. Second operand 3 states and 1994 transitions.
[2021-10-19 14:40:30,741 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 603 transitions, 1415 flow
[2021-10-19 14:40:30,744 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 603 transitions, 1415 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:40:30,748 INFO  L242             Difference]: Finished difference. Result has 607 places, 603 transitions, 1413 flow
[2021-10-19 14:40:30,749 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1413, PETRI_PLACES=607, PETRI_TRANSITIONS=603}
[2021-10-19 14:40:30,749 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -28 predicate places.
[2021-10-19 14:40:30,749 INFO  L470      AbstractCegarLoop]: Abstraction has has 607 places, 603 transitions, 1413 flow
[2021-10-19 14:40:30,750 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:30,750 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:30,750 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:30,750 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2021-10-19 14:40:30,750 INFO  L402      AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:30,750 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:30,750 INFO  L82        PathProgramCache]: Analyzing trace with hash -1210614377, now seen corresponding path program 1 times
[2021-10-19 14:40:30,750 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:30,750 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460008312]
[2021-10-19 14:40:30,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:30,751 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:30,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:30,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:30,803 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:30,804 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460008312]
[2021-10-19 14:40:30,804 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460008312] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:30,804 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:30,804 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:30,804 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93098822]
[2021-10-19 14:40:30,804 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:30,804 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:30,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:30,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:30,806 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 565 out of 690
[2021-10-19 14:40:30,806 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 603 transitions, 1413 flow. Second operand  has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:30,806 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:30,806 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 690
[2021-10-19 14:40:30,806 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:46,466 INFO  L129       PetriNetUnfolder]: 26846/111006 cut-off events.
[2021-10-19 14:40:46,466 INFO  L130       PetriNetUnfolder]: For 9465/9465 co-relation queries the response was YES.
[2021-10-19 14:40:47,466 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 166430 conditions, 111006 events. 26846/111006 cut-off events. For 9465/9465 co-relation queries the response was YES. Maximal size of possible extension queue 1619. Compared 1645342 event pairs, 6784 based on Foata normal form. 0/101666 useless extension candidates. Maximal degree in co-relation 166374. Up to 26646 conditions per place. 
[2021-10-19 14:40:47,730 INFO  L132   encePairwiseOnDemand]: 686/690 looper letters, 154 selfloop transitions, 2 changer transitions 0/651 dead transitions.
[2021-10-19 14:40:47,730 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 651 transitions, 1857 flow
[2021-10-19 14:40:47,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:47,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:47,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1834 transitions.
[2021-10-19 14:40:47,732 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8859903381642512
[2021-10-19 14:40:47,732 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1834 transitions.
[2021-10-19 14:40:47,732 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1834 transitions.
[2021-10-19 14:40:47,732 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:47,732 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1834 transitions.
[2021-10-19 14:40:47,734 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 611.3333333333334) internal successors, (1834), 3 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:47,735 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:47,735 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:47,735 INFO  L186             Difference]: Start difference. First operand has 607 places, 603 transitions, 1413 flow. Second operand 3 states and 1834 transitions.
[2021-10-19 14:40:47,735 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 651 transitions, 1857 flow
[2021-10-19 14:40:47,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 651 transitions, 1851 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:47,814 INFO  L242             Difference]: Finished difference. Result has 606 places, 603 transitions, 1417 flow
[2021-10-19 14:40:47,815 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1417, PETRI_PLACES=606, PETRI_TRANSITIONS=603}
[2021-10-19 14:40:47,815 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -29 predicate places.
[2021-10-19 14:40:47,815 INFO  L470      AbstractCegarLoop]: Abstraction has has 606 places, 603 transitions, 1417 flow
[2021-10-19 14:40:47,815 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 572.3333333333334) internal successors, (1717), 3 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:47,815 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:47,816 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:47,816 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2021-10-19 14:40:47,816 INFO  L402      AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:47,816 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:47,816 INFO  L82        PathProgramCache]: Analyzing trace with hash 1249746614, now seen corresponding path program 1 times
[2021-10-19 14:40:47,816 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:47,816 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095399005]
[2021-10-19 14:40:47,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:47,816 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:47,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:47,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:47,846 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:47,846 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095399005]
[2021-10-19 14:40:47,846 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095399005] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:47,846 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:47,846 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-19 14:40:47,847 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898467976]
[2021-10-19 14:40:47,847 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:47,847 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:47,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:47,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:47,848 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 661 out of 690
[2021-10-19 14:40:47,849 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 603 transitions, 1417 flow. Second operand  has 3 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:47,849 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:47,849 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 690
[2021-10-19 14:40:47,849 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:48,698 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][583], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, 832#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, 677#(= |#race~id_3~0| 0), Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 816#true, Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:48,698 INFO  L384   tUnfolder$Statistics]: this new event has 384 ancestors and is not cut-off event
[2021-10-19 14:40:48,699 INFO  L387   tUnfolder$Statistics]:   existing Event has 406 ancestors and is not cut-off event
[2021-10-19 14:40:48,699 INFO  L387   tUnfolder$Statistics]:   existing Event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:48,699 INFO  L387   tUnfolder$Statistics]:   existing Event has 406 ancestors and is not cut-off event
[2021-10-19 14:40:48,701 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][583], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, 832#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, 677#(= |#race~id_3~0| 0), Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), 743#(<= 2147483647 ~id_0~0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:48,701 INFO  L384   tUnfolder$Statistics]: this new event has 395 ancestors and is not cut-off event
[2021-10-19 14:40:48,701 INFO  L387   tUnfolder$Statistics]:   existing Event has 417 ancestors and is not cut-off event
[2021-10-19 14:40:48,701 INFO  L387   tUnfolder$Statistics]:   existing Event has 417 ancestors and is not cut-off event
[2021-10-19 14:40:48,701 INFO  L387   tUnfolder$Statistics]:   existing Event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:48,703 INFO  L129       PetriNetUnfolder]: 142/5772 cut-off events.
[2021-10-19 14:40:48,703 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:48,737 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6482 conditions, 5772 events. 142/5772 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 56223 event pairs, 0 based on Foata normal form. 0/5288 useless extension candidates. Maximal degree in co-relation 6428. Up to 103 conditions per place. 
[2021-10-19 14:40:48,744 INFO  L132   encePairwiseOnDemand]: 686/690 looper letters, 7 selfloop transitions, 3 changer transitions 0/605 dead transitions.
[2021-10-19 14:40:48,745 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 605 transitions, 1441 flow
[2021-10-19 14:40:48,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:48,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:48,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1994 transitions.
[2021-10-19 14:40:48,746 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9632850241545894
[2021-10-19 14:40:48,746 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1994 transitions.
[2021-10-19 14:40:48,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1994 transitions.
[2021-10-19 14:40:48,746 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:48,746 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1994 transitions.
[2021-10-19 14:40:48,748 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 664.6666666666666) internal successors, (1994), 3 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:48,749 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:48,749 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:48,749 INFO  L186             Difference]: Start difference. First operand has 606 places, 603 transitions, 1417 flow. Second operand 3 states and 1994 transitions.
[2021-10-19 14:40:48,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 605 transitions, 1441 flow
[2021-10-19 14:40:48,752 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 605 transitions, 1441 flow, removed 0 selfloop flow, removed 0 redundant places.
[2021-10-19 14:40:48,756 INFO  L242             Difference]: Finished difference. Result has 610 places, 605 transitions, 1439 flow
[2021-10-19 14:40:48,756 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=610, PETRI_TRANSITIONS=605}
[2021-10-19 14:40:48,757 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -25 predicate places.
[2021-10-19 14:40:48,757 INFO  L470      AbstractCegarLoop]: Abstraction has has 610 places, 605 transitions, 1439 flow
[2021-10-19 14:40:48,757 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:48,757 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:48,757 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:48,757 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2021-10-19 14:40:48,757 INFO  L402      AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:48,758 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:48,758 INFO  L82        PathProgramCache]: Analyzing trace with hash -461096390, now seen corresponding path program 1 times
[2021-10-19 14:40:48,758 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:48,758 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470462711]
[2021-10-19 14:40:48,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:48,758 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:48,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:48,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:48,787 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:48,787 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470462711]
[2021-10-19 14:40:48,787 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470462711] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:48,787 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:48,787 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:48,787 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677655619]
[2021-10-19 14:40:48,787 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:48,787 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:48,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:48,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:48,789 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 657 out of 690
[2021-10-19 14:40:48,789 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 605 transitions, 1439 flow. Second operand  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:48,789 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:48,789 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 690
[2021-10-19 14:40:48,790 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:49,658 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][581], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 838#true, Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, 832#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 816#true, Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:49,658 INFO  L384   tUnfolder$Statistics]: this new event has 406 ancestors and is not cut-off event
[2021-10-19 14:40:49,659 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:49,659 INFO  L387   tUnfolder$Statistics]:   existing Event has 414 ancestors and is not cut-off event
[2021-10-19 14:40:49,659 INFO  L387   tUnfolder$Statistics]:   existing Event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:49,661 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][581], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 838#true, Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, 832#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 743#(<= 2147483647 ~id_0~0), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:49,661 INFO  L384   tUnfolder$Statistics]: this new event has 417 ancestors and is not cut-off event
[2021-10-19 14:40:49,661 INFO  L387   tUnfolder$Statistics]:   existing Event has 425 ancestors and is not cut-off event
[2021-10-19 14:40:49,661 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:49,661 INFO  L387   tUnfolder$Statistics]:   existing Event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:49,663 INFO  L129       PetriNetUnfolder]: 132/6074 cut-off events.
[2021-10-19 14:40:49,663 INFO  L130       PetriNetUnfolder]: For 82/94 co-relation queries the response was YES.
[2021-10-19 14:40:49,690 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6870 conditions, 6074 events. 132/6074 cut-off events. For 82/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 59231 event pairs, 0 based on Foata normal form. 0/5622 useless extension candidates. Maximal degree in co-relation 6814. Up to 64 conditions per place. 
[2021-10-19 14:40:49,697 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 7 selfloop transitions, 1 changer transitions 0/603 dead transitions.
[2021-10-19 14:40:49,697 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 603 transitions, 1451 flow
[2021-10-19 14:40:49,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:49,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:49,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions.
[2021-10-19 14:40:49,698 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9570048309178744
[2021-10-19 14:40:49,698 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:49,698 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:49,699 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:49,699 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:49,700 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:49,701 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:49,701 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:49,701 INFO  L186             Difference]: Start difference. First operand has 610 places, 605 transitions, 1439 flow. Second operand 3 states and 1981 transitions.
[2021-10-19 14:40:49,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 603 transitions, 1451 flow
[2021-10-19 14:40:49,704 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 603 transitions, 1445 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:49,708 INFO  L242             Difference]: Finished difference. Result has 608 places, 603 transitions, 1431 flow
[2021-10-19 14:40:49,709 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=608, PETRI_TRANSITIONS=603}
[2021-10-19 14:40:49,709 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -27 predicate places.
[2021-10-19 14:40:49,709 INFO  L470      AbstractCegarLoop]: Abstraction has has 608 places, 603 transitions, 1431 flow
[2021-10-19 14:40:49,709 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:49,710 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:49,710 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:49,710 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2021-10-19 14:40:49,710 INFO  L402      AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:49,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:49,710 INFO  L82        PathProgramCache]: Analyzing trace with hash -731947042, now seen corresponding path program 1 times
[2021-10-19 14:40:49,710 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:49,710 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834619419]
[2021-10-19 14:40:49,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:49,711 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:49,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:49,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:49,742 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:49,742 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834619419]
[2021-10-19 14:40:49,742 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834619419] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:49,742 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:49,742 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:49,742 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621609248]
[2021-10-19 14:40:49,743 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:49,743 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:49,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:49,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:49,744 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 657 out of 690
[2021-10-19 14:40:49,745 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 603 transitions, 1431 flow. Second operand  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:49,745 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:49,745 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 690
[2021-10-19 14:40:49,745 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:50,605 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][579], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 842#true, 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 838#true, Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 816#true, Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:50,606 INFO  L384   tUnfolder$Statistics]: this new event has 406 ancestors and is not cut-off event
[2021-10-19 14:40:50,606 INFO  L387   tUnfolder$Statistics]:   existing Event has 414 ancestors and is not cut-off event
[2021-10-19 14:40:50,606 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:50,606 INFO  L387   tUnfolder$Statistics]:   existing Event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:50,608 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][579], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 842#true, 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 838#true, Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 743#(<= 2147483647 ~id_0~0), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:50,608 INFO  L384   tUnfolder$Statistics]: this new event has 417 ancestors and is not cut-off event
[2021-10-19 14:40:50,608 INFO  L387   tUnfolder$Statistics]:   existing Event has 425 ancestors and is not cut-off event
[2021-10-19 14:40:50,608 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:50,608 INFO  L387   tUnfolder$Statistics]:   existing Event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:50,610 INFO  L129       PetriNetUnfolder]: 132/6042 cut-off events.
[2021-10-19 14:40:50,610 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:50,636 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6818 conditions, 6042 events. 132/6042 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 58802 event pairs, 0 based on Foata normal form. 0/5606 useless extension candidates. Maximal degree in co-relation 6762. Up to 64 conditions per place. 
[2021-10-19 14:40:50,642 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 7 selfloop transitions, 1 changer transitions 0/601 dead transitions.
[2021-10-19 14:40:50,642 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 601 transitions, 1443 flow
[2021-10-19 14:40:50,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:50,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:50,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions.
[2021-10-19 14:40:50,643 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9570048309178744
[2021-10-19 14:40:50,643 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:50,643 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:50,644 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:50,644 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:50,645 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:50,646 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:50,646 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:50,646 INFO  L186             Difference]: Start difference. First operand has 608 places, 603 transitions, 1431 flow. Second operand 3 states and 1981 transitions.
[2021-10-19 14:40:50,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 601 transitions, 1443 flow
[2021-10-19 14:40:50,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 601 transitions, 1442 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-10-19 14:40:50,653 INFO  L242             Difference]: Finished difference. Result has 607 places, 601 transitions, 1428 flow
[2021-10-19 14:40:50,654 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=607, PETRI_TRANSITIONS=601}
[2021-10-19 14:40:50,654 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -28 predicate places.
[2021-10-19 14:40:50,654 INFO  L470      AbstractCegarLoop]: Abstraction has has 607 places, 601 transitions, 1428 flow
[2021-10-19 14:40:50,654 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:50,654 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:50,654 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:50,655 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2021-10-19 14:40:50,655 INFO  L402      AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:50,655 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:50,655 INFO  L82        PathProgramCache]: Analyzing trace with hash 1328038276, now seen corresponding path program 1 times
[2021-10-19 14:40:50,655 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:50,655 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278806313]
[2021-10-19 14:40:50,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:50,655 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:50,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:50,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:50,686 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:50,686 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278806313]
[2021-10-19 14:40:50,686 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278806313] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:50,686 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:50,686 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:50,686 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222836818]
[2021-10-19 14:40:50,686 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:50,686 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:50,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:50,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:50,688 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 657 out of 690
[2021-10-19 14:40:50,688 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 601 transitions, 1428 flow. Second operand  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:50,689 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:50,689 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 690
[2021-10-19 14:40:50,689 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:51,546 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][577], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 842#true, 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 816#true, Black: 743#(<= 2147483647 ~id_0~0), 846#true, 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:51,547 INFO  L384   tUnfolder$Statistics]: this new event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:51,547 INFO  L387   tUnfolder$Statistics]:   existing Event has 444 ancestors and is not cut-off event
[2021-10-19 14:40:51,547 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:51,547 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:51,550 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][577], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 842#true, 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), 846#true, Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 743#(<= 2147483647 ~id_0~0), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:51,550 INFO  L384   tUnfolder$Statistics]: this new event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:51,550 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:51,550 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:51,550 INFO  L387   tUnfolder$Statistics]:   existing Event has 455 ancestors and is not cut-off event
[2021-10-19 14:40:51,553 INFO  L129       PetriNetUnfolder]: 126/6244 cut-off events.
[2021-10-19 14:40:51,553 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:51,608 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7016 conditions, 6244 events. 126/6244 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 60842 event pairs, 0 based on Foata normal form. 0/5816 useless extension candidates. Maximal degree in co-relation 6960. Up to 64 conditions per place. 
[2021-10-19 14:40:51,618 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 7 selfloop transitions, 1 changer transitions 0/599 dead transitions.
[2021-10-19 14:40:51,619 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 599 transitions, 1440 flow
[2021-10-19 14:40:51,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:51,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:51,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions.
[2021-10-19 14:40:51,620 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9570048309178744
[2021-10-19 14:40:51,620 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:51,620 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:51,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:51,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:51,622 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:51,623 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:51,623 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:51,623 INFO  L186             Difference]: Start difference. First operand has 607 places, 601 transitions, 1428 flow. Second operand 3 states and 1981 transitions.
[2021-10-19 14:40:51,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 599 transitions, 1440 flow
[2021-10-19 14:40:51,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 599 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-10-19 14:40:51,631 INFO  L242             Difference]: Finished difference. Result has 606 places, 599 transitions, 1425 flow
[2021-10-19 14:40:51,632 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=606, PETRI_TRANSITIONS=599}
[2021-10-19 14:40:51,632 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -29 predicate places.
[2021-10-19 14:40:51,632 INFO  L470      AbstractCegarLoop]: Abstraction has has 606 places, 599 transitions, 1425 flow
[2021-10-19 14:40:51,632 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:51,632 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:51,632 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:51,632 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2021-10-19 14:40:51,632 INFO  L402      AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:51,633 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:51,633 INFO  L82        PathProgramCache]: Analyzing trace with hash 639553416, now seen corresponding path program 1 times
[2021-10-19 14:40:51,633 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:51,633 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49478344]
[2021-10-19 14:40:51,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:51,633 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:51,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:51,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:51,663 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:51,663 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49478344]
[2021-10-19 14:40:51,663 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49478344] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:51,663 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:51,663 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:51,663 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339360471]
[2021-10-19 14:40:51,663 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:51,663 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:51,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:51,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:51,665 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 657 out of 690
[2021-10-19 14:40:51,665 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 599 transitions, 1425 flow. Second operand  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:51,665 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:51,666 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 690
[2021-10-19 14:40:51,666 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:52,478 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][575], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, 850#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 816#true, 846#true, Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:52,478 INFO  L384   tUnfolder$Statistics]: this new event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:52,478 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:52,478 INFO  L387   tUnfolder$Statistics]:   existing Event has 444 ancestors and is not cut-off event
[2021-10-19 14:40:52,478 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:52,481 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][575], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, 850#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), 846#true, Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 743#(<= 2147483647 ~id_0~0), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), Black: 827#true])
[2021-10-19 14:40:52,481 INFO  L384   tUnfolder$Statistics]: this new event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:52,481 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:52,481 INFO  L387   tUnfolder$Statistics]:   existing Event has 455 ancestors and is not cut-off event
[2021-10-19 14:40:52,481 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:52,484 INFO  L129       PetriNetUnfolder]: 126/6212 cut-off events.
[2021-10-19 14:40:52,484 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:52,542 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 6212 events. 126/6212 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 60434 event pairs, 0 based on Foata normal form. 0/5816 useless extension candidates. Maximal degree in co-relation 6964. Up to 64 conditions per place. 
[2021-10-19 14:40:52,552 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 7 selfloop transitions, 1 changer transitions 0/597 dead transitions.
[2021-10-19 14:40:52,553 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 597 transitions, 1437 flow
[2021-10-19 14:40:52,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:52,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:52,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions.
[2021-10-19 14:40:52,554 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9570048309178744
[2021-10-19 14:40:52,554 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:52,554 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:52,554 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:52,554 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1981 transitions.
[2021-10-19 14:40:52,556 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:52,557 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:52,557 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:52,557 INFO  L186             Difference]: Start difference. First operand has 606 places, 599 transitions, 1425 flow. Second operand 3 states and 1981 transitions.
[2021-10-19 14:40:52,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 597 transitions, 1437 flow
[2021-10-19 14:40:52,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 597 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-10-19 14:40:52,564 INFO  L242             Difference]: Finished difference. Result has 605 places, 597 transitions, 1422 flow
[2021-10-19 14:40:52,565 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1422, PETRI_PLACES=605, PETRI_TRANSITIONS=597}
[2021-10-19 14:40:52,565 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -30 predicate places.
[2021-10-19 14:40:52,565 INFO  L470      AbstractCegarLoop]: Abstraction has has 605 places, 597 transitions, 1422 flow
[2021-10-19 14:40:52,565 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:52,565 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:52,566 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:52,566 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2021-10-19 14:40:52,566 INFO  L402      AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:52,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:52,566 INFO  L82        PathProgramCache]: Analyzing trace with hash 1713619832, now seen corresponding path program 1 times
[2021-10-19 14:40:52,566 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:52,566 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321091360]
[2021-10-19 14:40:52,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:52,566 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:52,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:52,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:52,595 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:52,595 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321091360]
[2021-10-19 14:40:52,595 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321091360] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:52,595 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:52,595 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:52,595 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698663487]
[2021-10-19 14:40:52,595 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:52,595 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:52,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:52,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:52,597 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:40:52,597 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 597 transitions, 1422 flow. Second operand  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:52,597 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:52,598 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:40:52,598 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:53,520 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][574], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, 850#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 816#true, Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), 854#true, Black: 827#true])
[2021-10-19 14:40:53,520 INFO  L384   tUnfolder$Statistics]: this new event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:53,520 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:53,520 INFO  L387   tUnfolder$Statistics]:   existing Event has 444 ancestors and is not cut-off event
[2021-10-19 14:40:53,520 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:53,523 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][574], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, 850#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 743#(<= 2147483647 ~id_0~0), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), 854#true, Black: 827#true])
[2021-10-19 14:40:53,523 INFO  L384   tUnfolder$Statistics]: this new event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:53,523 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:53,523 INFO  L387   tUnfolder$Statistics]:   existing Event has 455 ancestors and is not cut-off event
[2021-10-19 14:40:53,523 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:53,525 INFO  L129       PetriNetUnfolder]: 126/6168 cut-off events.
[2021-10-19 14:40:53,525 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:53,557 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7130 conditions, 6168 events. 126/6168 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 59714 event pairs, 0 based on Foata normal form. 0/5816 useless extension candidates. Maximal degree in co-relation 7074. Up to 141 conditions per place. 
[2021-10-19 14:40:53,563 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 11 selfloop transitions, 2 changer transitions 0/596 dead transitions.
[2021-10-19 14:40:53,563 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 596 transitions, 1446 flow
[2021-10-19 14:40:53,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:53,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:53,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions.
[2021-10-19 14:40:53,565 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9545893719806763
[2021-10-19 14:40:53,565 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:53,565 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:53,565 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:53,565 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions.
[2021-10-19 14:40:53,566 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:53,568 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:53,568 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:53,568 INFO  L186             Difference]: Start difference. First operand has 605 places, 597 transitions, 1422 flow. Second operand 3 states and 1976 transitions.
[2021-10-19 14:40:53,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 596 transitions, 1446 flow
[2021-10-19 14:40:53,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 596 transitions, 1445 flow, removed 0 selfloop flow, removed 1 redundant places.
[2021-10-19 14:40:53,575 INFO  L242             Difference]: Finished difference. Result has 605 places, 596 transitions, 1423 flow
[2021-10-19 14:40:53,576 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=605, PETRI_TRANSITIONS=596}
[2021-10-19 14:40:53,576 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -30 predicate places.
[2021-10-19 14:40:53,576 INFO  L470      AbstractCegarLoop]: Abstraction has has 605 places, 596 transitions, 1423 flow
[2021-10-19 14:40:53,576 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:53,576 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:53,576 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:53,577 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2021-10-19 14:40:53,577 INFO  L402      AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:53,577 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:53,577 INFO  L82        PathProgramCache]: Analyzing trace with hash 1267778693, now seen corresponding path program 1 times
[2021-10-19 14:40:53,577 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:53,577 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454481797]
[2021-10-19 14:40:53,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:53,577 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:53,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:53,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:53,606 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:53,606 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454481797]
[2021-10-19 14:40:53,606 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454481797] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:53,606 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:53,606 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-19 14:40:53,606 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727392416]
[2021-10-19 14:40:53,606 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-19 14:40:53,607 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:53,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-19 14:40:53,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-19 14:40:53,608 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 654 out of 690
[2021-10-19 14:40:53,609 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 596 transitions, 1423 flow. Second operand  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:53,609 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:53,609 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 690
[2021-10-19 14:40:53,609 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-10-19 14:40:54,477 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][573], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 818#(= |#race~contains_key_4~0| 0), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 816#true, Black: 743#(<= 2147483647 ~id_0~0), 732#(= |#race~get_2~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), 854#true, Black: 827#true, 858#true])
[2021-10-19 14:40:54,477 INFO  L384   tUnfolder$Statistics]: this new event has 428 ancestors and is not cut-off event
[2021-10-19 14:40:54,477 INFO  L387   tUnfolder$Statistics]:   existing Event has 444 ancestors and is not cut-off event
[2021-10-19 14:40:54,477 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:54,477 INFO  L387   tUnfolder$Statistics]:   existing Event has 436 ancestors and is not cut-off event
[2021-10-19 14:40:54,480 INFO  L382   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1843] thread2EXIT-->L90-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem61_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{ULTIMATE.start_main_#t~mem61=|v_ULTIMATE.start_main_#t~mem61_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][573], [Black: 765#(and (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0)), Black: 764#(and (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (store (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 761#true, Black: 763#(= (select (store (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1) 0) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 834#(not |thread2Thread1of1ForFork1_#t~short23|), 766#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 818#(= |#race~contains_key_4~0| 0), 777#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ |ULTIMATE.start_main_~#t1~0.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) |ULTIMATE.start_main_~#t1~0.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 2 |ULTIMATE.start_main_~#t1~0.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0.base|) (+ 3 |ULTIMATE.start_main_~#t1~0.offset|)) 0)), 804#(= |#race~contains_key_1~0| 0), 158#L90-7true, 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 813#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 786#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0)), Black: 787#(and (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset) 0) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0)), Black: 783#true, Black: 785#(= (select (store (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1) 0) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 669#(= |#race~id_0~0| 0), Black: 730#true, Black: 735#true, Black: 802#true, 829#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 737#(= |#race~get_5~0| 0), Black: 811#true, Black: 816#true, Black: 748#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|)), 677#(= |#race~id_3~0| 0), Black: 750#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 732#(= |#race~get_2~0| 0), Black: 752#(and (= ULTIMATE.start_create_fresh_int_array_~i~0 0) (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size|) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), 743#(<= 2147483647 ~id_0~0), Black: 754#(and (<= 2147483647 ~id_0~0) (<= 2147483648 ULTIMATE.start_create_fresh_int_array_~size)), Black: 823#(not |thread1Thread1of1ForFork0_#t~short9|), 854#true, 858#true, Black: 827#true])
[2021-10-19 14:40:54,481 INFO  L384   tUnfolder$Statistics]: this new event has 439 ancestors and is not cut-off event
[2021-10-19 14:40:54,481 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:54,481 INFO  L387   tUnfolder$Statistics]:   existing Event has 447 ancestors and is not cut-off event
[2021-10-19 14:40:54,481 INFO  L387   tUnfolder$Statistics]:   existing Event has 455 ancestors and is not cut-off event
[2021-10-19 14:40:54,484 INFO  L129       PetriNetUnfolder]: 126/6124 cut-off events.
[2021-10-19 14:40:54,484 INFO  L130       PetriNetUnfolder]: For 26/38 co-relation queries the response was YES.
[2021-10-19 14:40:54,542 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7166 conditions, 6124 events. 126/6124 cut-off events. For 26/38 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 59159 event pairs, 0 based on Foata normal form. 0/5816 useless extension candidates. Maximal degree in co-relation 7110. Up to 133 conditions per place. 
[2021-10-19 14:40:54,552 INFO  L132   encePairwiseOnDemand]: 687/690 looper letters, 10 selfloop transitions, 2 changer transitions 0/595 dead transitions.
[2021-10-19 14:40:54,552 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 595 transitions, 1445 flow
[2021-10-19 14:40:54,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-19 14:40:54,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-10-19 14:40:54,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions.
[2021-10-19 14:40:54,554 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9541062801932367
[2021-10-19 14:40:54,554 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions.
[2021-10-19 14:40:54,554 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions.
[2021-10-19 14:40:54,554 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-19 14:40:54,554 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions.
[2021-10-19 14:40:54,555 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:54,556 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:54,557 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 690.0) internal successors, (2760), 4 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:54,557 INFO  L186             Difference]: Start difference. First operand has 605 places, 596 transitions, 1423 flow. Second operand 3 states and 1975 transitions.
[2021-10-19 14:40:54,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 595 transitions, 1445 flow
[2021-10-19 14:40:54,561 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 595 transitions, 1441 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-10-19 14:40:54,565 INFO  L242             Difference]: Finished difference. Result has 604 places, 595 transitions, 1421 flow
[2021-10-19 14:40:54,565 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=690, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1421, PETRI_PLACES=604, PETRI_TRANSITIONS=595}
[2021-10-19 14:40:54,565 INFO  L334   CegarLoopForPetriNet]: 635 programPoint places, -31 predicate places.
[2021-10-19 14:40:54,566 INFO  L470      AbstractCegarLoop]: Abstraction has has 604 places, 595 transitions, 1421 flow
[2021-10-19 14:40:54,566 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 656.0) internal successors, (1968), 3 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:54,566 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-10-19 14:40:54,566 INFO  L254   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-19 14:40:54,566 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2021-10-19 14:40:54,566 INFO  L402      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 128 more)] ===
[2021-10-19 14:40:54,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-19 14:40:54,567 INFO  L82        PathProgramCache]: Analyzing trace with hash 155987699, now seen corresponding path program 1 times
[2021-10-19 14:40:54,567 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-19 14:40:54,567 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735274516]
[2021-10-19 14:40:54,567 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-19 14:40:54,567 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-19 14:40:54,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-19 14:40:54,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-19 14:40:54,648 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-19 14:40:54,648 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735274516]
[2021-10-19 14:40:54,648 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735274516] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-19 14:40:54,648 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-19 14:40:54,648 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-19 14:40:54,648 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720796884]
[2021-10-19 14:40:54,649 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-10-19 14:40:54,649 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-19 14:40:54,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-19 14:40:54,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2021-10-19 14:40:54,651 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 573 out of 690
[2021-10-19 14:40:54,652 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 595 transitions, 1421 flow. Second operand  has 6 states, 6 states have (on average 577.6666666666666) internal successors, (3466), 6 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-19 14:40:54,652 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-10-19 14:40:54,652 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 573 of 690
[2021-10-19 14:40:54,652 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand