./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version 9bd2c7ff
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:50:53,576 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:50:53,677 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-19 07:50:53,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:50:53,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:50:53,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:50:53,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:50:53,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:50:53,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:50:53,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:50:53,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:50:53,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:50:53,738 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:50:53,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:50:53,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:50:53,741 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:50:53,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:50:53,741 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:50:53,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:50:53,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:50:53,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:50:53,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:50:53,743 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2023-11-19 07:50:53,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 07:50:53,744 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:50:53,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:50:53,745 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:50:53,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:50:53,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:50:53,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:50:53,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:50:53,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:50:53,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:50:53,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:50:53,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:50:53,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:50:53,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:50:53,748 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:50:53,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:50:53,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:50:53,749 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:50:53,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131
[2023-11-19 07:50:54,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:50:54,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:50:54,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:50:54,118 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:50:54,119 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:50:54,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i
[2023-11-19 07:50:57,274 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:50:57,541 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:50:57,555 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i
[2023-11-19 07:50:57,573 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/data/e042157e3/27af4509e58f405aa7f1f99abd40368d/FLAG5666c3c35
[2023-11-19 07:50:57,590 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/data/e042157e3/27af4509e58f405aa7f1f99abd40368d
[2023-11-19 07:50:57,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:50:57,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:50:57,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:50:57,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:50:57,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:50:57,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:57" (1/1) ...
[2023-11-19 07:50:57,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d2682e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:57, skipping insertion in model container
[2023-11-19 07:50:57,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:57" (1/1) ...
[2023-11-19 07:50:57,656 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:50:58,087 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:50:58,104 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:50:58,156 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:50:58,198 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:50:58,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58 WrapperNode
[2023-11-19 07:50:58,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:50:58,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:50:58,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:50:58,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:50:58,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,282 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 89
[2023-11-19 07:50:58,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:50:58,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:50:58,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:50:58,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:50:58,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:50:58,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:50:58,316 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:50:58,316 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:50:58,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (1/1) ...
[2023-11-19 07:50:58,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:50:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:58,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:50:58,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83693950-fb00-498d-90b4-40f53229788d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:50:58,403 INFO L130 BoogieDeclarations]: Found specification of procedure thr1
[2023-11-19 07:50:58,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1
[2023-11-19 07:50:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:50:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-19 07:50:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:50:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:50:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:50:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:50:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:50:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:50:58,408 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-19 07:50:58,607 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:50:58,612 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:50:58,871 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:50:58,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:50:58,882 INFO L302 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-19 07:50:58,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:58 BoogieIcfgContainer
[2023-11-19 07:50:58,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:50:58,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:50:58,890 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:50:58,894 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:50:58,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:50:57" (1/3) ...
[2023-11-19 07:50:58,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e57af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:58, skipping insertion in model container
[2023-11-19 07:50:58,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:58" (2/3) ...
[2023-11-19 07:50:58,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e57af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:58, skipping insertion in model container
[2023-11-19 07:50:58,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:58" (3/3) ...
[2023-11-19 07:50:58,898 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i
[2023-11-19 07:50:58,908 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-19 07:50:58,918 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:50:58,918 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-11-19 07:50:58,918 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:50:58,977 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:50:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 103 transitions, 210 flow
[2023-11-19 07:50:59,149 INFO L124 PetriNetUnfolderBase]: 8/155 cut-off events.
[2023-11-19 07:50:59,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:50:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 155 events. 8/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 374 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place.
[2023-11-19 07:50:59,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 103 transitions, 210 flow
[2023-11-19 07:50:59,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 103 transitions, 210 flow
[2023-11-19 07:50:59,165 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:50:59,183 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 103 transitions, 210 flow
[2023-11-19 07:50:59,186 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 103 transitions, 210 flow
[2023-11-19 07:50:59,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 103 transitions, 210 flow
[2023-11-19 07:50:59,239 INFO L124 PetriNetUnfolderBase]: 8/155 cut-off events.
[2023-11-19 07:50:59,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:50:59,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 155 events. 8/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 374 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place.
[2023-11-19 07:50:59,245 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300
[2023-11-19 07:51:01,398 INFO L134 LiptonReduction]: Checked pairs total: 9517
[2023-11-19 07:51:01,399 INFO L136 LiptonReduction]: Total number of compositions: 81
[2023-11-19 07:51:01,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:51:01,434 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bdcbeb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:51:01,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-19 07:51:01,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:51:01,439 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events.
[2023-11-19 07:51:01,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:01,439 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:01,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:51:01,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-19 07:51:01,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash 358638267, now seen corresponding path program 1 times
[2023-11-19 07:51:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786470435]
[2023-11-19 07:51:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:01,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:01,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786470435]
[2023-11-19 07:51:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786470435] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122812759]
[2023-11-19 07:51:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:01,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:01,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:01,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 184
[2023-11-19 07:51:01,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:01,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:01,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 184
[2023-11-19 07:51:01,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:01,968 INFO L124 PetriNetUnfolderBase]: 68/237 cut-off events.
[2023-11-19 07:51:01,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:01,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 237 events. 68/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1227 event pairs, 56 based on Foata normal form. 21/222 useless extension candidates. Maximal degree in co-relation 367. Up to 155 conditions per place.
[2023-11-19 07:51:01,972 INFO L140 encePairwiseOnDemand]: 174/184 looper letters, 21 selfloop transitions, 5 changer transitions 0/42 dead transitions.
[2023-11-19 07:51:01,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 140 flow
[2023-11-19 07:51:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions.
[2023-11-19 07:51:01,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914
[2023-11-19 07:51:01,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions.
[2023-11-19 07:51:01,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions.
[2023-11-19 07:51:01,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:01,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions.
[2023-11-19 07:51:01,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:02,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:02,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:02,008 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 86 flow. Second operand 3 states and 282 transitions.
[2023-11-19 07:51:02,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 140 flow
[2023-11-19 07:51:02,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:51:02,014 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 107 flow
[2023-11-19 07:51:02,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=41, PETRI_TRANSITIONS=39}
[2023-11-19 07:51:02,020 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places.
[2023-11-19 07:51:02,020 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 107 flow
[2023-11-19 07:51:02,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:02,021 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:02,021 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-19 07:51:02,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:51:02,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-19 07:51:02,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1775089322, now seen corresponding path program 1 times
[2023-11-19 07:51:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469242763]
[2023-11-19 07:51:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:51:02,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:51:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:51:02,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:51:02,090 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:51:02,092 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2023-11-19 07:51:02,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2023-11-19 07:51:02,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2023-11-19 07:51:02,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2023-11-19 07:51:02,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2023-11-19 07:51:02,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2023-11-19 07:51:02,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2023-11-19 07:51:02,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2023-11-19 07:51:02,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2023-11-19 07:51:02,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2023-11-19 07:51:02,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:51:02,098 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1]
[2023-11-19 07:51:02,101 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-19 07:51:02,101 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-19 07:51:02,124 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:51:02,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 134 transitions, 278 flow
[2023-11-19 07:51:02,168 INFO L124 PetriNetUnfolderBase]: 13/240 cut-off events.
[2023-11-19 07:51:02,169 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-11-19 07:51:02,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 240 events. 13/240 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 156. Up to 6 conditions per place.
[2023-11-19 07:51:02,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 134 transitions, 278 flow
[2023-11-19 07:51:02,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 134 transitions, 278 flow
[2023-11-19 07:51:02,190 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:51:02,190 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 134 transitions, 278 flow
[2023-11-19 07:51:02,190 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 134 transitions, 278 flow
[2023-11-19 07:51:02,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 134 transitions, 278 flow
[2023-11-19 07:51:02,225 INFO L124 PetriNetUnfolderBase]: 13/240 cut-off events.
[2023-11-19 07:51:02,225 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-11-19 07:51:02,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 240 events. 13/240 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 156. Up to 6 conditions per place.
[2023-11-19 07:51:02,236 INFO L119 LiptonReduction]: Number of co-enabled transitions 8460
[2023-11-19 07:51:04,247 INFO L134 LiptonReduction]: Checked pairs total: 28421
[2023-11-19 07:51:04,247 INFO L136 LiptonReduction]: Total number of compositions: 101
[2023-11-19 07:51:04,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:51:04,251 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bdcbeb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:51:04,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-19 07:51:04,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:51:04,254 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2023-11-19 07:51:04,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:04,255 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:04,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:51:04,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-19 07:51:04,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash 612433684, now seen corresponding path program 1 times
[2023-11-19 07:51:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477013668]
[2023-11-19 07:51:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:04,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:04,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477013668]
[2023-11-19 07:51:04,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477013668] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089300700]
[2023-11-19 07:51:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:04,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:04,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:04,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235
[2023-11-19 07:51:04,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:04,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:04,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235
[2023-11-19 07:51:04,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:04,752 INFO L124 PetriNetUnfolderBase]: 1095/2272 cut-off events.
[2023-11-19 07:51:04,752 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2023-11-19 07:51:04,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2272 events. 1095/2272 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15992 event pairs, 928 based on Foata normal form. 61/2086 useless extension candidates. Maximal degree in co-relation 767. Up to 1699 conditions per place.
[2023-11-19 07:51:04,772 INFO L140 encePairwiseOnDemand]: 220/235 looper letters, 32 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2023-11-19 07:51:04,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 218 flow
[2023-11-19 07:51:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions.
[2023-11-19 07:51:04,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276595744680851
[2023-11-19 07:51:04,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions.
[2023-11-19 07:51:04,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions.
[2023-11-19 07:51:04,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:04,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions.
[2023-11-19 07:51:04,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:04,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:04,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:04,789 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 132 flow. Second operand 3 states and 372 transitions.
[2023-11-19 07:51:04,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 218 flow
[2023-11-19 07:51:04,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:51:04,793 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 164 flow
[2023-11-19 07:51:04,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=57}
[2023-11-19 07:51:04,794 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places.
[2023-11-19 07:51:04,795 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 164 flow
[2023-11-19 07:51:04,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:04,795 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:04,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:04,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:51:04,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-19 07:51:04,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash -51314239, now seen corresponding path program 1 times
[2023-11-19 07:51:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643897669]
[2023-11-19 07:51:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:04,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643897669]
[2023-11-19 07:51:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643897669] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:04,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:04,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:04,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102500381]
[2023-11-19 07:51:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:04,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:04,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:04,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:04,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235
[2023-11-19 07:51:04,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:04,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:04,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235
[2023-11-19 07:51:04,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:05,416 INFO L124 PetriNetUnfolderBase]: 1726/3359 cut-off events.
[2023-11-19 07:51:05,417 INFO L125 PetriNetUnfolderBase]: For 775/871 co-relation queries the response was YES.
[2023-11-19 07:51:05,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7432 conditions, 3359 events. 1726/3359 cut-off events. For 775/871 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23770 event pairs, 1028 based on Foata normal form. 2/2989 useless extension candidates. Maximal degree in co-relation 4144. Up to 2242 conditions per place.
[2023-11-19 07:51:05,449 INFO L140 encePairwiseOnDemand]: 225/235 looper letters, 45 selfloop transitions, 14 changer transitions 0/82 dead transitions.
[2023-11-19 07:51:05,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 365 flow
[2023-11-19 07:51:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions.
[2023-11-19 07:51:05,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213
[2023-11-19 07:51:05,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions.
[2023-11-19 07:51:05,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions.
[2023-11-19 07:51:05,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:05,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions.
[2023-11-19 07:51:05,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:05,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:05,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:05,458 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 164 flow. Second operand 3 states and 375 transitions.
[2023-11-19 07:51:05,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 365 flow
[2023-11-19 07:51:05,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:51:05,466 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 280 flow
[2023-11-19 07:51:05,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=61, PETRI_TRANSITIONS=69}
[2023-11-19 07:51:05,469 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places.
[2023-11-19 07:51:05,470 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 280 flow
[2023-11-19 07:51:05,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:05,470 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:05,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:51:05,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-19 07:51:05,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 138409103, now seen corresponding path program 1 times
[2023-11-19 07:51:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:05,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047946832]
[2023-11-19 07:51:05,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:05,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:05,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047946832]
[2023-11-19 07:51:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047946832] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311751672]
[2023-11-19 07:51:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:05,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:05,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:05,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235
[2023-11-19 07:51:05,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:05,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:05,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235
[2023-11-19 07:51:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:06,355 INFO L124 PetriNetUnfolderBase]: 3314/6491 cut-off events.
[2023-11-19 07:51:06,355 INFO L125 PetriNetUnfolderBase]: For 5891/6336 co-relation queries the response was YES.
[2023-11-19 07:51:06,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16664 conditions, 6491 events. 3314/6491 cut-off events. For 5891/6336 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 51423 event pairs, 1244 based on Foata normal form. 80/5937 useless extension candidates. Maximal degree in co-relation 9626. Up to 3064 conditions per place.
[2023-11-19 07:51:06,429 INFO L140 encePairwiseOnDemand]: 220/235 looper letters, 63 selfloop transitions, 28 changer transitions 0/111 dead transitions.
[2023-11-19 07:51:06,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 661 flow
[2023-11-19 07:51:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions.
[2023-11-19 07:51:06,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404255319148936
[2023-11-19 07:51:06,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions.
[2023-11-19 07:51:06,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions.
[2023-11-19 07:51:06,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:06,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions.
[2023-11-19 07:51:06,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:06,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:06,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:06,437 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 280 flow. Second operand 3 states and 381 transitions.
[2023-11-19 07:51:06,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 661 flow
[2023-11-19 07:51:06,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:51:06,459 INFO L231 Difference]: Finished difference. Result has 63 places, 96 transitions, 562 flow
[2023-11-19 07:51:06,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=63, PETRI_TRANSITIONS=96}
[2023-11-19 07:51:06,461 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places.
[2023-11-19 07:51:06,462 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 96 transitions, 562 flow
[2023-11-19 07:51:06,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:06,462 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:06,463 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-19 07:51:06,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:51:06,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-11-19 07:51:06,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1769116168, now seen corresponding path program 1 times
[2023-11-19 07:51:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:06,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322035727]
[2023-11-19 07:51:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:51:06,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:51:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:51:06,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:51:06,533 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:51:06,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-11-19 07:51:06,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-11-19 07:51:06,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-11-19 07:51:06,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-11-19 07:51:06,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-11-19 07:51:06,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-11-19 07:51:06,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-11-19 07:51:06,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-11-19 07:51:06,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-11-19 07:51:06,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-11-19 07:51:06,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-11-19 07:51:06,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-11-19 07:51:06,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-11-19 07:51:06,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:51:06,542 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-19 07:51:06,542 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-19 07:51:06,543 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-19 07:51:06,576 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:51:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 165 transitions, 348 flow
[2023-11-19 07:51:06,625 INFO L124 PetriNetUnfolderBase]: 18/325 cut-off events.
[2023-11-19 07:51:06,625 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2023-11-19 07:51:06,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 325 events. 18/325 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1184 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 244. Up to 8 conditions per place.
[2023-11-19 07:51:06,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 165 transitions, 348 flow
[2023-11-19 07:51:06,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 165 transitions, 348 flow
[2023-11-19 07:51:06,633 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:51:06,633 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 165 transitions, 348 flow
[2023-11-19 07:51:06,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 165 transitions, 348 flow
[2023-11-19 07:51:06,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 165 transitions, 348 flow
[2023-11-19 07:51:06,679 INFO L124 PetriNetUnfolderBase]: 18/325 cut-off events.
[2023-11-19 07:51:06,679 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2023-11-19 07:51:06,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 325 events. 18/325 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1184 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 244. Up to 8 conditions per place.
[2023-11-19 07:51:06,698 INFO L119 LiptonReduction]: Number of co-enabled transitions 15480
[2023-11-19 07:51:08,855 INFO L134 LiptonReduction]: Checked pairs total: 53170
[2023-11-19 07:51:08,856 INFO L136 LiptonReduction]: Total number of compositions: 119
[2023-11-19 07:51:08,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:51:08,858 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5bdcbeb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:51:08,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2023-11-19 07:51:08,861 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:51:08,861 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events.
[2023-11-19 07:51:08,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:51:08,861 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:08,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 07:51:08,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-19 07:51:08,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash 912962303, now seen corresponding path program 1 times
[2023-11-19 07:51:08,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:08,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850043811]
[2023-11-19 07:51:08,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:08,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850043811]
[2023-11-19 07:51:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850043811] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461886346]
[2023-11-19 07:51:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:08,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:08,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 284
[2023-11-19 07:51:08,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:08,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:08,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 284
[2023-11-19 07:51:08,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:12,680 INFO L124 PetriNetUnfolderBase]: 19069/33869 cut-off events.
[2023-11-19 07:51:12,680 INFO L125 PetriNetUnfolderBase]: For 538/538 co-relation queries the response was YES.
[2023-11-19 07:51:12,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61061 conditions, 33869 events. 19069/33869 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 1257. Compared 303895 event pairs, 16531 based on Foata normal form. 1521/31323 useless extension candidates. Maximal degree in co-relation 5828. Up to 25241 conditions per place.
[2023-11-19 07:51:12,895 INFO L140 encePairwiseOnDemand]: 264/284 looper letters, 48 selfloop transitions, 11 changer transitions 0/89 dead transitions.
[2023-11-19 07:51:12,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 89 transitions, 314 flow
[2023-11-19 07:51:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions.
[2023-11-19 07:51:12,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481220657276995
[2023-11-19 07:51:12,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions.
[2023-11-19 07:51:12,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions.
[2023-11-19 07:51:12,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:12,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions.
[2023-11-19 07:51:12,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:12,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:12,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:12,909 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 178 flow. Second operand 3 states and 467 transitions.
[2023-11-19 07:51:12,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 89 transitions, 314 flow
[2023-11-19 07:51:12,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 312 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-11-19 07:51:12,915 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 223 flow
[2023-11-19 07:51:12,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=76, PETRI_TRANSITIONS=76}
[2023-11-19 07:51:12,918 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places.
[2023-11-19 07:51:12,918 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 223 flow
[2023-11-19 07:51:12,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:12,920 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:12,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:51:12,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-19 07:51:12,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 935465607, now seen corresponding path program 1 times
[2023-11-19 07:51:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626121540]
[2023-11-19 07:51:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626121540]
[2023-11-19 07:51:12,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626121540] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042059441]
[2023-11-19 07:51:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:12,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:13,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 284
[2023-11-19 07:51:13,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:13,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:13,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 284
[2023-11-19 07:51:13,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:16,925 INFO L124 PetriNetUnfolderBase]: 22655/39446 cut-off events.
[2023-11-19 07:51:16,925 INFO L125 PetriNetUnfolderBase]: For 8688/10346 co-relation queries the response was YES.
[2023-11-19 07:51:17,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85003 conditions, 39446 events. 22655/39446 cut-off events. For 8688/10346 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 357575 event pairs, 17591 based on Foata normal form. 19/34415 useless extension candidates. Maximal degree in co-relation 35212. Up to 29412 conditions per place.
[2023-11-19 07:51:17,332 INFO L140 encePairwiseOnDemand]: 272/284 looper letters, 61 selfloop transitions, 12 changer transitions 0/103 dead transitions.
[2023-11-19 07:51:17,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 450 flow
[2023-11-19 07:51:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions.
[2023-11-19 07:51:17,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434272300469484
[2023-11-19 07:51:17,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions.
[2023-11-19 07:51:17,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions.
[2023-11-19 07:51:17,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:17,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions.
[2023-11-19 07:51:17,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:17,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:17,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:17,340 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 223 flow. Second operand 3 states and 463 transitions.
[2023-11-19 07:51:17,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 450 flow
[2023-11-19 07:51:17,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:51:17,358 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 304 flow
[2023-11-19 07:51:17,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=78, PETRI_TRANSITIONS=86}
[2023-11-19 07:51:17,359 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -1 predicate places.
[2023-11-19 07:51:17,360 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 304 flow
[2023-11-19 07:51:17,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:17,360 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:17,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:51:17,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-19 07:51:17,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1183642394, now seen corresponding path program 1 times
[2023-11-19 07:51:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:17,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060542510]
[2023-11-19 07:51:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060542510]
[2023-11-19 07:51:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060542510] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:17,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832148170]
[2023-11-19 07:51:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:17,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:17,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 284
[2023-11-19 07:51:17,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:17,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:17,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 284
[2023-11-19 07:51:17,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:27,173 INFO L124 PetriNetUnfolderBase]: 66541/110109 cut-off events.
[2023-11-19 07:51:27,174 INFO L125 PetriNetUnfolderBase]: For 66116/71708 co-relation queries the response was YES.
[2023-11-19 07:51:27,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268086 conditions, 110109 events. 66541/110109 cut-off events. For 66116/71708 co-relation queries the response was YES. Maximal size of possible extension queue 3744. Compared 1042459 event pairs, 27789 based on Foata normal form. 228/99537 useless extension candidates. Maximal degree in co-relation 152705. Up to 54329 conditions per place.
[2023-11-19 07:51:27,996 INFO L140 encePairwiseOnDemand]: 264/284 looper letters, 86 selfloop transitions, 34 changer transitions 0/143 dead transitions.
[2023-11-19 07:51:27,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 143 transitions, 780 flow
[2023-11-19 07:51:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions.
[2023-11-19 07:51:28,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528169014084507
[2023-11-19 07:51:28,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions.
[2023-11-19 07:51:28,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions.
[2023-11-19 07:51:28,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:28,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions.
[2023-11-19 07:51:28,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:28,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:28,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:28,008 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 304 flow. Second operand 3 states and 471 transitions.
[2023-11-19 07:51:28,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 143 transitions, 780 flow
[2023-11-19 07:51:30,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 143 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 07:51:30,011 INFO L231 Difference]: Finished difference. Result has 81 places, 120 transitions, 664 flow
[2023-11-19 07:51:30,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=81, PETRI_TRANSITIONS=120}
[2023-11-19 07:51:30,012 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 2 predicate places.
[2023-11-19 07:51:30,012 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 120 transitions, 664 flow
[2023-11-19 07:51:30,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:30,013 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:30,013 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:30,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:51:30,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-19 07:51:30,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash -565138380, now seen corresponding path program 1 times
[2023-11-19 07:51:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804039992]
[2023-11-19 07:51:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-19 07:51:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:30,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804039992]
[2023-11-19 07:51:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804039992] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:30,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:30,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334284286]
[2023-11-19 07:51:30,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:30,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:30,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:30,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:30,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 284
[2023-11-19 07:51:30,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 120 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:30,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:30,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 284
[2023-11-19 07:51:30,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:32,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][78], [thr1Thread1of3ForFork0InUse, 5#L693true, 182#true, thr1Thread2of3ForFork0InUse, 112#L693-7true, thr1Thread3of3ForFork0InUse, 74#L693-7true, Black: 176#true, 16#L693-6true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 178#(= |#race~c~0| 0)])
[2023-11-19 07:51:32,836 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event
[2023-11-19 07:51:32,836 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event
[2023-11-19 07:51:32,836 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event
[2023-11-19 07:51:32,836 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event
[2023-11-19 07:51:33,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][78], [thr1Thread1of3ForFork0InUse, 182#true, 112#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 176#true, 74#L693-7true, 16#L693-6true, 6#L693-2true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 178#(= |#race~c~0| 0), Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:33,560 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,561 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([720] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][107], [thr1Thread1of3ForFork0InUse, 182#true, 112#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 74#L693-7true, Black: 178#(= |#race~c~0| 0), 122#L693-3true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, 152#L693-5true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:33,666 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,666 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,666 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:33,666 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:34,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([822] L693-12-->L693-14: Formula: (= |v_#race~c~0_89| |v_thr1Thread1of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_89|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread1of3ForFork0_#t~nondet3#1][44], [thr1Thread1of3ForFork0InUse, 5#L693true, 182#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 74#L693-7true, Black: 178#(= |#race~c~0| 0), 39#L693-14true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, 152#L693-5true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:34,115 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,115 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,115 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,115 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L693-12-->L693-14: Formula: (= |v_#race~c~0_105| |v_thr1Thread2of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_105|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread2of3ForFork0_#t~nondet3#1][85], [thr1Thread1of3ForFork0InUse, 5#L693true, 182#true, 112#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, 152#L693-5true, 95#L693-14true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:34,119 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,119 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,119 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,119 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event
[2023-11-19 07:51:34,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([754] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][77], [thr1Thread1of3ForFork0InUse, 182#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 113#L693-7true, thr1Thread2of3ForFork0InUse, Black: 176#true, thr1Thread3of3ForFork0InUse, 90#L693-6true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 119#L693-7true, 178#(= |#race~c~0| 0), Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:34,574 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,574 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,574 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,575 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([822] L693-12-->L693-14: Formula: (= |v_#race~c~0_89| |v_thr1Thread1of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_89|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread1of3ForFork0_#t~nondet3#1][44], [thr1Thread1of3ForFork0InUse, 182#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 74#L693-7true, Black: 178#(= |#race~c~0| 0), 39#L693-14true, 6#L693-2true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, 152#L693-5true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:34,692 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,692 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,693 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,693 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L693-12-->L693-14: Formula: (= |v_#race~c~0_105| |v_thr1Thread2of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_105|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread2of3ForFork0_#t~nondet3#1][85], [thr1Thread1of3ForFork0InUse, 182#true, 112#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), 6#L693-2true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, 152#L693-5true, 95#L693-14true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:34,698 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,699 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,699 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,699 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][78], [thr1Thread1of3ForFork0InUse, 113#L693-7true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 182#true, thr1Thread2of3ForFork0InUse, 112#L693-7true, thr1Thread3of3ForFork0InUse, Black: 176#true, 16#L693-6true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 178#(= |#race~c~0| 0), Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:34,700 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,700 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,700 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:34,700 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:35,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L693-12-->L693-14: Formula: (= |v_ULTIMATE.start_thr1_#t~nondet3#1_60| |v_#race~c~0_101|) InVars {} OutVars{#race~c~0=|v_#race~c~0_101|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_60|} AuxVars[] AssignedVars[#race~c~0, ULTIMATE.start_thr1_#t~nondet3#1][26], [thr1Thread1of3ForFork0InUse, 60#L693-5true, 182#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 113#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 53#L693-14true, 176#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:35,804 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,804 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,804 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,804 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L693-12-->L693-14: Formula: (= |v_#race~c~0_87| |v_thr1Thread3of3ForFork0_#t~nondet3#1_13|) InVars {} OutVars{#race~c~0=|v_#race~c~0_87|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_13|} AuxVars[] AssignedVars[#race~c~0, thr1Thread3of3ForFork0_#t~nondet3#1][118], [thr1Thread1of3ForFork0InUse, 57#L693-14true, 60#L693-5true, 182#true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 119#L693-7true])
[2023-11-19 07:51:35,815 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,815 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,815 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,816 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([822] L693-12-->L693-14: Formula: (= |v_#race~c~0_89| |v_thr1Thread1of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_89|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread1of3ForFork0_#t~nondet3#1][44], [thr1Thread1of3ForFork0InUse, 182#true, 113#L693-7true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), 39#L693-14true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 152#L693-5true, 176#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:35,917 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,917 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,917 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,918 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L693-12-->L693-14: Formula: (= |v_#race~c~0_87| |v_thr1Thread3of3ForFork0_#t~nondet3#1_13|) InVars {} OutVars{#race~c~0=|v_#race~c~0_87|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_13|} AuxVars[] AssignedVars[#race~c~0, thr1Thread3of3ForFork0_#t~nondet3#1][118], [thr1Thread1of3ForFork0InUse, 57#L693-14true, 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 182#true, thr1Thread2of3ForFork0InUse, 112#L693-7true, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 152#L693-5true, 176#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:35,921 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,921 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,921 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:35,921 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event
[2023-11-19 07:51:38,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L693-12-->L693-14: Formula: (= |v_ULTIMATE.start_thr1_#t~nondet3#1_60| |v_#race~c~0_101|) InVars {} OutVars{#race~c~0=|v_#race~c~0_101|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_60|} AuxVars[] AssignedVars[#race~c~0, ULTIMATE.start_thr1_#t~nondet3#1][26], [thr1Thread1of3ForFork0InUse, 182#true, thr1Thread2of3ForFork0InUse, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L15true, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), 53#L693-14true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, 118#L694true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:38,567 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-11-19 07:51:38,567 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event
[2023-11-19 07:51:38,567 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event
[2023-11-19 07:51:38,567 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event
[2023-11-19 07:51:38,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([856] L693-12-->L693-14: Formula: (= |v_ULTIMATE.start_thr1_#t~nondet3#1_60| |v_#race~c~0_101|) InVars {} OutVars{#race~c~0=|v_#race~c~0_101|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_60|} AuxVars[] AssignedVars[#race~c~0, ULTIMATE.start_thr1_#t~nondet3#1][26], [thr1Thread1of3ForFork0InUse, 182#true, thr1Thread2of3ForFork0InUse, 26#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L15true, 15#thr1EXITtrue, thr1Thread3of3ForFork0InUse, Black: 178#(= |#race~c~0| 0), 53#L693-14true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 176#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|)])
[2023-11-19 07:51:38,709 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event
[2023-11-19 07:51:38,709 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event
[2023-11-19 07:51:38,709 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event
[2023-11-19 07:51:38,709 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event
[2023-11-19 07:51:39,087 INFO L124 PetriNetUnfolderBase]: 60632/103802 cut-off events.
[2023-11-19 07:51:39,087 INFO L125 PetriNetUnfolderBase]: For 214928/227749 co-relation queries the response was YES.
[2023-11-19 07:51:39,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322156 conditions, 103802 events. 60632/103802 cut-off events. For 214928/227749 co-relation queries the response was YES. Maximal size of possible extension queue 3950. Compared 1034482 event pairs, 32258 based on Foata normal form. 972/93316 useless extension candidates. Maximal degree in co-relation 188007. Up to 74662 conditions per place.
[2023-11-19 07:51:40,196 INFO L140 encePairwiseOnDemand]: 272/284 looper letters, 95 selfloop transitions, 25 changer transitions 0/154 dead transitions.
[2023-11-19 07:51:40,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 154 transitions, 1091 flow
[2023-11-19 07:51:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:51:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:51:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions.
[2023-11-19 07:51:40,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5410798122065728
[2023-11-19 07:51:40,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions.
[2023-11-19 07:51:40,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions.
[2023-11-19 07:51:40,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:51:40,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions.
[2023-11-19 07:51:40,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:40,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:40,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:40,204 INFO L175 Difference]: Start difference. First operand has 81 places, 120 transitions, 664 flow. Second operand 3 states and 461 transitions.
[2023-11-19 07:51:40,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 154 transitions, 1091 flow
[2023-11-19 07:51:40,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 154 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:51:40,404 INFO L231 Difference]: Finished difference. Result has 82 places, 139 transitions, 841 flow
[2023-11-19 07:51:40,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=82, PETRI_TRANSITIONS=139}
[2023-11-19 07:51:40,405 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places.
[2023-11-19 07:51:40,405 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 139 transitions, 841 flow
[2023-11-19 07:51:40,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:40,406 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:51:40,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:51:40,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:51:40,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-19 07:51:40,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:51:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2086848614, now seen corresponding path program 1 times
[2023-11-19 07:51:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:51:40,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975476805]
[2023-11-19 07:51:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:51:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:51:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:51:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:51:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:51:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975476805]
[2023-11-19 07:51:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975476805] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:51:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:51:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:51:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138457644]
[2023-11-19 07:51:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:51:40,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:51:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:51:40,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:51:40,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:51:40,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 284
[2023-11-19 07:51:40,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 139 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:51:40,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:51:40,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 284
[2023-11-19 07:51:40,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:51:44,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 16#L693-6true, 6#L693-2true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 112#L693-7true, Black: 176#true, 74#L693-7true, Black: 184#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|)])
[2023-11-19 07:51:44,027 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-11-19 07:51:44,027 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:44,027 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:44,027 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event
[2023-11-19 07:51:44,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([720] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][103], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 122#L693-3true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 152#L693-5true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 112#L693-7true, 74#L693-7true, Black: 178#(= |#race~c~0| 0), Black: 184#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|)])
[2023-11-19 07:51:44,856 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event
[2023-11-19 07:51:44,856 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event
[2023-11-19 07:51:44,856 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event
[2023-11-19 07:51:44,856 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event
[2023-11-19 07:51:45,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([754] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][69], [thr1Thread1of3ForFork0InUse, 113#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 119#L693-7true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 182#true, Black: 176#true, 90#L693-6true, Black: 184#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|)])
[2023-11-19 07:51:45,239 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,240 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([822] L693-12-->L693-14: Formula: (= |v_#race~c~0_89| |v_thr1Thread1of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_89|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread1of3ForFork0_#t~nondet3#1][39], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 6#L693-2true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 152#L693-5true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 74#L693-7true, Black: 178#(= |#race~c~0| 0), 39#L693-14true, Black: 184#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|)])
[2023-11-19 07:51:45,309 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,309 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,309 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,309 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L693-12-->L693-14: Formula: (= |v_#race~c~0_105| |v_thr1Thread2of3ForFork0_#t~nondet3#1_15|) InVars {} OutVars{#race~c~0=|v_#race~c~0_105|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_15|} AuxVars[] AssignedVars[#race~c~0, thr1Thread2of3ForFork0_#t~nondet3#1][76], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 6#L693-2true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, 152#L693-5true, 95#L693-14true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 182#true, 112#L693-7true, Black: 178#(= |#race~c~0| 0), Black: 184#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|)])
[2023-11-19 07:51:45,313 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][70], [thr1Thread1of3ForFork0InUse, 113#L693-7true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 16#L693-6true, Black: 168#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 187#true, Black: 173#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 34#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 182#true, 112#L693-7true, Black: 176#true, Black: 184#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|)])
[2023-11-19 07:51:45,314 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,314 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,315 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event
[2023-11-19 07:51:45,315 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event