./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b 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_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:33:05,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:33:05,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:33:05,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:33:05,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:33:05,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:33:05,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:33:05,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:33:05,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:33:05,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:33:05,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:33:05,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:33:05,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:33:05,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:33:05,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:33:05,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:33:05,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:33:05,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:33:05,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:33:05,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:33:05,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:33:05,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:33:05,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:33:05,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:33:05,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:33:05,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:33:05,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:33:05,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:33:05,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:33:05,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:33:05,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:33:05,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:33:05,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:33:05,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:33:05,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:33:05,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:33:05,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:33:05,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:33:05,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:33:05,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:33:05,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:33:05,309 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 09:33:05,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:33:05,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:33:05,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:33:05,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:33:05,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:33:05,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:33:05,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:33:05,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:33:05,354 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:33:05,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:33:05,356 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:33:05,356 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:33:05,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:33:05,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:33:05,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:33:05,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:33:05,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:33:05,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:33:05,358 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 09:33:05,358 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:33:05,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:33:05,358 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:33:05,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:33:05,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:33:05,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:33:05,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:33:05,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:33:05,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:33:05,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:33:05,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:33:05,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:33:05,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:33:05,362 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:33:05,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:33:05,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:33:05,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/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_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 [2022-11-20 09:33:05,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:33:05,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:33:05,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:33:05,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:33:05,784 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:33:05,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-11-20 09:33:08,942 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:33:09,227 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:33:09,227 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-11-20 09:33:09,246 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/data/8258ea536/d102091cd2b84886afd3b608ed4cb643/FLAG100a7cf3c [2022-11-20 09:33:09,305 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/data/8258ea536/d102091cd2b84886afd3b608ed4cb643 [2022-11-20 09:33:09,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:33:09,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:33:09,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:33:09,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:33:09,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:33:09,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c705857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09, skipping insertion in model container [2022-11-20 09:33:09,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:33:09,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:33:09,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-11-20 09:33:09,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:33:09,563 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:33:09,603 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-11-20 09:33:09,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:33:09,620 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:33:09,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09 WrapperNode [2022-11-20 09:33:09,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:33:09,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:33:09,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:33:09,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:33:09,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,687 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 271 [2022-11-20 09:33:09,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:33:09,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:33:09,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:33:09,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:33:09,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,774 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:33:09,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:33:09,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:33:09,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:33:09,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (1/1) ... [2022-11-20 09:33:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:33:09,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:09,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:33:09,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:33:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:33:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:33:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:33:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:33:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 09:33:09,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 09:33:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 09:33:09,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 09:33:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 09:33:09,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 09:33:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-20 09:33:09,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-20 09:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-20 09:33:09,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-20 09:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-20 09:33:09,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-20 09:33:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:33:09,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:33:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:33:09,877 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:33:10,088 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:33:10,090 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:33:10,860 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:33:10,874 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:33:10,875 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 09:33:10,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:10 BoogieIcfgContainer [2022-11-20 09:33:10,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:33:10,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:33:10,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:33:10,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:33:10,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:33:09" (1/3) ... [2022-11-20 09:33:10,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3debea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:33:10, skipping insertion in model container [2022-11-20 09:33:10,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:09" (2/3) ... [2022-11-20 09:33:10,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3debea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:33:10, skipping insertion in model container [2022-11-20 09:33:10,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:10" (3/3) ... [2022-11-20 09:33:10,889 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-11-20 09:33:10,899 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:33:10,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:33:10,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-11-20 09:33:10,912 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:33:11,059 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-11-20 09:33:11,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 463 transitions, 974 flow [2022-11-20 09:33:11,329 INFO L130 PetriNetUnfolder]: 24/457 cut-off events. [2022-11-20 09:33:11,329 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 09:33:11,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 24/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 806 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 285. Up to 2 conditions per place. [2022-11-20 09:33:11,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 463 transitions, 974 flow [2022-11-20 09:33:11,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 421 transitions, 878 flow [2022-11-20 09:33:11,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:33:11,376 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49b48b0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:33:11,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2022-11-20 09:33:11,381 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-11-20 09:33:11,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:33:11,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:11,382 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:11,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1336015694, now seen corresponding path program 1 times [2022-11-20 09:33:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:11,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25934282] [2022-11-20 09:33:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:11,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25934282] [2022-11-20 09:33:11,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25934282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:11,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:11,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459100049] [2022-11-20 09:33:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:11,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:11,774 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-20 09:33:11,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 421 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:11,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:11,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-20 09:33:11,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:12,089 INFO L130 PetriNetUnfolder]: 80/583 cut-off events. [2022-11-20 09:33:12,091 INFO L131 PetriNetUnfolder]: For 84/91 co-relation queries the response was YES. [2022-11-20 09:33:12,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 583 events. 80/583 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2246 event pairs, 60 based on Foata normal form. 211/668 useless extension candidates. Maximal degree in co-relation 614. Up to 157 conditions per place. [2022-11-20 09:33:12,108 INFO L137 encePairwiseOnDemand]: 453/463 looper letters, 36 selfloop transitions, 2 changer transitions 1/413 dead transitions. [2022-11-20 09:33:12,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 413 transitions, 938 flow [2022-11-20 09:33:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2022-11-20 09:33:12,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9294456443484521 [2022-11-20 09:33:12,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1291 transitions. [2022-11-20 09:33:12,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1291 transitions. [2022-11-20 09:33:12,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:12,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1291 transitions. [2022-11-20 09:33:12,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,166 INFO L175 Difference]: Start difference. First operand has 418 places, 421 transitions, 878 flow. Second operand 3 states and 1291 transitions. [2022-11-20 09:33:12,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 413 transitions, 938 flow [2022-11-20 09:33:12,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 413 transitions, 914 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-11-20 09:33:12,191 INFO L231 Difference]: Finished difference. Result has 407 places, 412 transitions, 840 flow [2022-11-20 09:33:12,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=407, PETRI_TRANSITIONS=412} [2022-11-20 09:33:12,201 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -11 predicate places. [2022-11-20 09:33:12,201 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 412 transitions, 840 flow [2022-11-20 09:33:12,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,203 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:12,203 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:12,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:33:12,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1730917584, now seen corresponding path program 1 times [2022-11-20 09:33:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615829477] [2022-11-20 09:33:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:12,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:12,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615829477] [2022-11-20 09:33:12,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615829477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:12,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:12,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734577609] [2022-11-20 09:33:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:12,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:12,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:12,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:12,361 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-20 09:33:12,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 412 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:12,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-20 09:33:12,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:12,639 INFO L130 PetriNetUnfolder]: 80/581 cut-off events. [2022-11-20 09:33:12,639 INFO L131 PetriNetUnfolder]: For 18/24 co-relation queries the response was YES. [2022-11-20 09:33:12,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 581 events. 80/581 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2230 event pairs, 60 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 761. Up to 157 conditions per place. [2022-11-20 09:33:12,652 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2022-11-20 09:33:12,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 914 flow [2022-11-20 09:33:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-20 09:33:12,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-20 09:33:12,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-20 09:33:12,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-20 09:33:12,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:12,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-20 09:33:12,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,668 INFO L175 Difference]: Start difference. First operand has 407 places, 412 transitions, 840 flow. Second operand 3 states and 1284 transitions. [2022-11-20 09:33:12,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 914 flow [2022-11-20 09:33:12,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 411 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:12,682 INFO L231 Difference]: Finished difference. Result has 405 places, 411 transitions, 838 flow [2022-11-20 09:33:12,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=405, PETRI_TRANSITIONS=411} [2022-11-20 09:33:12,685 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -13 predicate places. [2022-11-20 09:33:12,685 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 411 transitions, 838 flow [2022-11-20 09:33:12,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:12,687 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:12,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:33:12,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 740256022, now seen corresponding path program 1 times [2022-11-20 09:33:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:12,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723679466] [2022-11-20 09:33:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723679466] [2022-11-20 09:33:12,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723679466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:12,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:12,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454508176] [2022-11-20 09:33:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:12,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:12,815 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-20 09:33:12,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 411 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:12,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:12,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-20 09:33:12,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:13,083 INFO L130 PetriNetUnfolder]: 80/580 cut-off events. [2022-11-20 09:33:13,084 INFO L131 PetriNetUnfolder]: For 30/36 co-relation queries the response was YES. [2022-11-20 09:33:13,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 580 events. 80/580 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2205 event pairs, 60 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 742. Up to 157 conditions per place. [2022-11-20 09:33:13,098 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-20 09:33:13,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 410 transitions, 912 flow [2022-11-20 09:33:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-20 09:33:13,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-20 09:33:13,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:13,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,114 INFO L175 Difference]: Start difference. First operand has 405 places, 411 transitions, 838 flow. Second operand 3 states and 1284 transitions. [2022-11-20 09:33:13,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 410 transitions, 912 flow [2022-11-20 09:33:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:13,123 INFO L231 Difference]: Finished difference. Result has 404 places, 410 transitions, 836 flow [2022-11-20 09:33:13,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=404, PETRI_TRANSITIONS=410} [2022-11-20 09:33:13,126 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -14 predicate places. [2022-11-20 09:33:13,127 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 836 flow [2022-11-20 09:33:13,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:13,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:13,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:33:13,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:13,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1949606868, now seen corresponding path program 1 times [2022-11-20 09:33:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:13,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333907799] [2022-11-20 09:33:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:13,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:13,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333907799] [2022-11-20 09:33:13,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333907799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:13,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:13,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971107154] [2022-11-20 09:33:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:13,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:13,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-20 09:33:13,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 410 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:13,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-20 09:33:13,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:13,497 INFO L130 PetriNetUnfolder]: 80/579 cut-off events. [2022-11-20 09:33:13,498 INFO L131 PetriNetUnfolder]: For 42/48 co-relation queries the response was YES. [2022-11-20 09:33:13,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 579 events. 80/579 cut-off events. For 42/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2169 event pairs, 60 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 723. Up to 157 conditions per place. [2022-11-20 09:33:13,510 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-11-20 09:33:13,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 409 transitions, 910 flow [2022-11-20 09:33:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-20 09:33:13,514 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-20 09:33:13,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:13,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,524 INFO L175 Difference]: Start difference. First operand has 404 places, 410 transitions, 836 flow. Second operand 3 states and 1284 transitions. [2022-11-20 09:33:13,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 409 transitions, 910 flow [2022-11-20 09:33:13,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 409 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:13,532 INFO L231 Difference]: Finished difference. Result has 403 places, 409 transitions, 834 flow [2022-11-20 09:33:13,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=403, PETRI_TRANSITIONS=409} [2022-11-20 09:33:13,534 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -15 predicate places. [2022-11-20 09:33:13,534 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 409 transitions, 834 flow [2022-11-20 09:33:13,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:13,536 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:13,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:33:13,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1482091646, now seen corresponding path program 1 times [2022-11-20 09:33:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:13,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957327926] [2022-11-20 09:33:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:13,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957327926] [2022-11-20 09:33:13,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957327926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:13,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:13,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556945376] [2022-11-20 09:33:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:13,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:13,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-20 09:33:13,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 409 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:13,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-20 09:33:13,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:13,804 INFO L130 PetriNetUnfolder]: 80/578 cut-off events. [2022-11-20 09:33:13,804 INFO L131 PetriNetUnfolder]: For 54/60 co-relation queries the response was YES. [2022-11-20 09:33:13,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 578 events. 80/578 cut-off events. For 54/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2126 event pairs, 60 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 704. Up to 157 conditions per place. [2022-11-20 09:33:13,814 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-11-20 09:33:13,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 408 transitions, 908 flow [2022-11-20 09:33:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-11-20 09:33:13,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-11-20 09:33:13,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:13,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-11-20 09:33:13,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,826 INFO L175 Difference]: Start difference. First operand has 403 places, 409 transitions, 834 flow. Second operand 3 states and 1284 transitions. [2022-11-20 09:33:13,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 408 transitions, 908 flow [2022-11-20 09:33:13,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 408 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:13,834 INFO L231 Difference]: Finished difference. Result has 402 places, 408 transitions, 832 flow [2022-11-20 09:33:13,835 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=402, PETRI_TRANSITIONS=408} [2022-11-20 09:33:13,839 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -16 predicate places. [2022-11-20 09:33:13,839 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 408 transitions, 832 flow [2022-11-20 09:33:13,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:13,841 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:13,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:33:13,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1485355233, now seen corresponding path program 1 times [2022-11-20 09:33:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300736706] [2022-11-20 09:33:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300736706] [2022-11-20 09:33:13,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300736706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:13,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949273595] [2022-11-20 09:33:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:13,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:13,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:13,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:13,947 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-11-20 09:33:13,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:13,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:13,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-11-20 09:33:13,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:14,172 INFO L130 PetriNetUnfolder]: 80/577 cut-off events. [2022-11-20 09:33:14,178 INFO L131 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2022-11-20 09:33:14,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 577 events. 80/577 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2128 event pairs, 60 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 684. Up to 156 conditions per place. [2022-11-20 09:33:14,188 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 35 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2022-11-20 09:33:14,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 407 transitions, 904 flow [2022-11-20 09:33:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2022-11-20 09:33:14,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9236861051115911 [2022-11-20 09:33:14,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2022-11-20 09:33:14,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2022-11-20 09:33:14,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:14,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2022-11-20 09:33:14,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:14,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:14,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:14,218 INFO L175 Difference]: Start difference. First operand has 402 places, 408 transitions, 832 flow. Second operand 3 states and 1283 transitions. [2022-11-20 09:33:14,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 407 transitions, 904 flow [2022-11-20 09:33:14,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 407 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:14,227 INFO L231 Difference]: Finished difference. Result has 401 places, 407 transitions, 830 flow [2022-11-20 09:33:14,228 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=401, PETRI_TRANSITIONS=407} [2022-11-20 09:33:14,230 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -17 predicate places. [2022-11-20 09:33:14,231 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 407 transitions, 830 flow [2022-11-20 09:33:14,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:14,233 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:14,233 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:14,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:33:14,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1143953655, now seen corresponding path program 1 times [2022-11-20 09:33:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:14,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863471549] [2022-11-20 09:33:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:14,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863471549] [2022-11-20 09:33:14,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863471549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:14,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:14,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588842018] [2022-11-20 09:33:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:14,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:14,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:33:14,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 407 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:14,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:14,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:33:14,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:28,271 INFO L130 PetriNetUnfolder]: 26740/76416 cut-off events. [2022-11-20 09:33:28,271 INFO L131 PetriNetUnfolder]: For 1365/1736 co-relation queries the response was YES. [2022-11-20 09:33:28,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108529 conditions, 76416 events. 26740/76416 cut-off events. For 1365/1736 co-relation queries the response was YES. Maximal size of possible extension queue 3869. Compared 1069678 event pairs, 23895 based on Foata normal form. 0/55614 useless extension candidates. Maximal degree in co-relation 108462. Up to 30742 conditions per place. [2022-11-20 09:33:29,972 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 51 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2022-11-20 09:33:29,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 406 transitions, 934 flow [2022-11-20 09:33:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2022-11-20 09:33:29,976 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9028077753779697 [2022-11-20 09:33:29,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2022-11-20 09:33:29,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2022-11-20 09:33:29,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:29,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2022-11-20 09:33:29,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,986 INFO L175 Difference]: Start difference. First operand has 401 places, 407 transitions, 830 flow. Second operand 3 states and 1254 transitions. [2022-11-20 09:33:29,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 406 transitions, 934 flow [2022-11-20 09:33:29,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 406 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:29,995 INFO L231 Difference]: Finished difference. Result has 400 places, 406 transitions, 828 flow [2022-11-20 09:33:29,996 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=400, PETRI_TRANSITIONS=406} [2022-11-20 09:33:29,997 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -18 predicate places. [2022-11-20 09:33:29,997 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 406 transitions, 828 flow [2022-11-20 09:33:29,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:29,998 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:29,998 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:29,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:33:29,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2022394243, now seen corresponding path program 1 times [2022-11-20 09:33:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:30,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928893654] [2022-11-20 09:33:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:30,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928893654] [2022-11-20 09:33:30,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928893654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:30,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:30,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737952359] [2022-11-20 09:33:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:30,075 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-20 09:33:30,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 406 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:30,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-20 09:33:30,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:30,232 INFO L130 PetriNetUnfolder]: 65/546 cut-off events. [2022-11-20 09:33:30,232 INFO L131 PetriNetUnfolder]: For 6/11 co-relation queries the response was YES. [2022-11-20 09:33:30,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 546 events. 65/546 cut-off events. For 6/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1931 event pairs, 30 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 653. Up to 90 conditions per place. [2022-11-20 09:33:30,241 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2022-11-20 09:33:30,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 406 transitions, 903 flow [2022-11-20 09:33:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-20 09:33:30,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-11-20 09:33:30,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-20 09:33:30,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-20 09:33:30,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:30,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-20 09:33:30,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,253 INFO L175 Difference]: Start difference. First operand has 400 places, 406 transitions, 828 flow. Second operand 3 states and 1295 transitions. [2022-11-20 09:33:30,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 406 transitions, 903 flow [2022-11-20 09:33:30,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 406 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:30,262 INFO L231 Difference]: Finished difference. Result has 395 places, 401 transitions, 825 flow [2022-11-20 09:33:30,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=395, PETRI_TRANSITIONS=401} [2022-11-20 09:33:30,266 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -23 predicate places. [2022-11-20 09:33:30,266 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 401 transitions, 825 flow [2022-11-20 09:33:30,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:30,268 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:30,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:33:30,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2099345529, now seen corresponding path program 1 times [2022-11-20 09:33:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129726988] [2022-11-20 09:33:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:30,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129726988] [2022-11-20 09:33:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129726988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:30,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:30,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13920500] [2022-11-20 09:33:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:30,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:30,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-20 09:33:30,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 401 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:30,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-20 09:33:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:30,481 INFO L130 PetriNetUnfolder]: 65/541 cut-off events. [2022-11-20 09:33:30,482 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-11-20 09:33:30,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 541 events. 65/541 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1945 event pairs, 30 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 634. Up to 90 conditions per place. [2022-11-20 09:33:30,490 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2022-11-20 09:33:30,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 401 transitions, 900 flow [2022-11-20 09:33:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-20 09:33:30,494 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-11-20 09:33:30,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-20 09:33:30,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-20 09:33:30,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:30,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-20 09:33:30,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,512 INFO L175 Difference]: Start difference. First operand has 395 places, 401 transitions, 825 flow. Second operand 3 states and 1295 transitions. [2022-11-20 09:33:30,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 401 transitions, 900 flow [2022-11-20 09:33:30,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 401 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:30,520 INFO L231 Difference]: Finished difference. Result has 391 places, 396 transitions, 823 flow [2022-11-20 09:33:30,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=391, PETRI_TRANSITIONS=396} [2022-11-20 09:33:30,521 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -27 predicate places. [2022-11-20 09:33:30,521 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 396 transitions, 823 flow [2022-11-20 09:33:30,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,523 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:30,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:30,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:33:30,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1479418596, now seen corresponding path program 1 times [2022-11-20 09:33:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104170623] [2022-11-20 09:33:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:30,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104170623] [2022-11-20 09:33:30,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104170623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:30,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:30,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194235688] [2022-11-20 09:33:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:30,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:30,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:30,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:30,573 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-20 09:33:30,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 396 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:30,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-20 09:33:30,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:30,801 INFO L130 PetriNetUnfolder]: 81/896 cut-off events. [2022-11-20 09:33:30,801 INFO L131 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2022-11-20 09:33:30,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 896 events. 81/896 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4418 event pairs, 33 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 994. Up to 90 conditions per place. [2022-11-20 09:33:30,815 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 35 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2022-11-20 09:33:30,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 399 transitions, 913 flow [2022-11-20 09:33:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2022-11-20 09:33:30,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9344852411807055 [2022-11-20 09:33:30,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1298 transitions. [2022-11-20 09:33:30,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1298 transitions. [2022-11-20 09:33:30,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:30,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1298 transitions. [2022-11-20 09:33:30,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,826 INFO L175 Difference]: Start difference. First operand has 391 places, 396 transitions, 823 flow. Second operand 3 states and 1298 transitions. [2022-11-20 09:33:30,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 399 transitions, 913 flow [2022-11-20 09:33:30,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 399 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:30,833 INFO L231 Difference]: Finished difference. Result has 387 places, 391 transitions, 821 flow [2022-11-20 09:33:30,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=387, PETRI_TRANSITIONS=391} [2022-11-20 09:33:30,835 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -31 predicate places. [2022-11-20 09:33:30,835 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 391 transitions, 821 flow [2022-11-20 09:33:30,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:30,837 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:30,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:33:30,839 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -87068456, now seen corresponding path program 1 times [2022-11-20 09:33:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:30,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217539167] [2022-11-20 09:33:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:30,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217539167] [2022-11-20 09:33:30,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217539167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:30,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:30,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756162] [2022-11-20 09:33:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:30,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:30,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:30,892 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-20 09:33:30,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 391 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:30,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:30,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-20 09:33:30,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:31,149 INFO L130 PetriNetUnfolder]: 123/936 cut-off events. [2022-11-20 09:33:31,149 INFO L131 PetriNetUnfolder]: For 65/69 co-relation queries the response was YES. [2022-11-20 09:33:31,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 936 events. 123/936 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4836 event pairs, 47 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 801. Up to 150 conditions per place. [2022-11-20 09:33:31,166 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 0/395 dead transitions. [2022-11-20 09:33:31,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 395 transitions, 916 flow [2022-11-20 09:33:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-20 09:33:31,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9352051835853131 [2022-11-20 09:33:31,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-20 09:33:31,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-20 09:33:31,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:31,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-20 09:33:31,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,180 INFO L175 Difference]: Start difference. First operand has 387 places, 391 transitions, 821 flow. Second operand 3 states and 1299 transitions. [2022-11-20 09:33:31,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 395 transitions, 916 flow [2022-11-20 09:33:31,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 395 transitions, 913 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:31,188 INFO L231 Difference]: Finished difference. Result has 383 places, 386 transitions, 819 flow [2022-11-20 09:33:31,188 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=819, PETRI_PLACES=383, PETRI_TRANSITIONS=386} [2022-11-20 09:33:31,189 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -35 predicate places. [2022-11-20 09:33:31,189 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 386 transitions, 819 flow [2022-11-20 09:33:31,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,190 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:31,190 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:31,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:33:31,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash -91411477, now seen corresponding path program 1 times [2022-11-20 09:33:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:31,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926145606] [2022-11-20 09:33:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:31,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926145606] [2022-11-20 09:33:31,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926145606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:31,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:31,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:31,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745975417] [2022-11-20 09:33:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:31,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:31,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:31,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:31,350 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-20 09:33:31,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 386 transitions, 819 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:31,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-20 09:33:31,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:31,733 INFO L130 PetriNetUnfolder]: 136/1506 cut-off events. [2022-11-20 09:33:31,733 INFO L131 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2022-11-20 09:33:31,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1506 events. 136/1506 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9289 event pairs, 59 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 1080. Up to 167 conditions per place. [2022-11-20 09:33:31,758 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 37 selfloop transitions, 3 changer transitions 0/391 dead transitions. [2022-11-20 09:33:31,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 391 transitions, 919 flow [2022-11-20 09:33:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-11-20 09:33:31,762 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-11-20 09:33:31,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-11-20 09:33:31,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-11-20 09:33:31,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:31,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-11-20 09:33:31,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,770 INFO L175 Difference]: Start difference. First operand has 383 places, 386 transitions, 819 flow. Second operand 3 states and 1300 transitions. [2022-11-20 09:33:31,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 391 transitions, 919 flow [2022-11-20 09:33:31,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 391 transitions, 916 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:31,778 INFO L231 Difference]: Finished difference. Result has 379 places, 381 transitions, 817 flow [2022-11-20 09:33:31,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=379, PETRI_TRANSITIONS=381} [2022-11-20 09:33:31,779 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -39 predicate places. [2022-11-20 09:33:31,780 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 381 transitions, 817 flow [2022-11-20 09:33:31,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:31,780 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:31,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:33:31,781 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1947059132, now seen corresponding path program 1 times [2022-11-20 09:33:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:31,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621929400] [2022-11-20 09:33:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:31,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621929400] [2022-11-20 09:33:31,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621929400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:31,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:31,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:31,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697054240] [2022-11-20 09:33:31,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:31,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:31,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-11-20 09:33:31,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 381 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:31,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:31,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-11-20 09:33:31,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:32,246 INFO L130 PetriNetUnfolder]: 205/1762 cut-off events. [2022-11-20 09:33:32,246 INFO L131 PetriNetUnfolder]: For 185/189 co-relation queries the response was YES. [2022-11-20 09:33:32,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 1762 events. 205/1762 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11644 event pairs, 104 based on Foata normal form. 1/1499 useless extension candidates. Maximal degree in co-relation 1036. Up to 261 conditions per place. [2022-11-20 09:33:32,274 INFO L137 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 8/387 dead transitions. [2022-11-20 09:33:32,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 387 transitions, 920 flow [2022-11-20 09:33:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-11-20 09:33:32,279 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-11-20 09:33:32,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-11-20 09:33:32,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-11-20 09:33:32,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:32,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-11-20 09:33:32,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:32,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:32,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:32,288 INFO L175 Difference]: Start difference. First operand has 379 places, 381 transitions, 817 flow. Second operand 3 states and 1300 transitions. [2022-11-20 09:33:32,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 387 transitions, 920 flow [2022-11-20 09:33:32,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 387 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:32,296 INFO L231 Difference]: Finished difference. Result has 375 places, 368 transitions, 799 flow [2022-11-20 09:33:32,297 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=375, PETRI_TRANSITIONS=368} [2022-11-20 09:33:32,298 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -43 predicate places. [2022-11-20 09:33:32,298 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 368 transitions, 799 flow [2022-11-20 09:33:32,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:32,299 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:32,300 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:32,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:33:32,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 427726989, now seen corresponding path program 1 times [2022-11-20 09:33:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:32,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101053645] [2022-11-20 09:33:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:32,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101053645] [2022-11-20 09:33:32,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101053645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:32,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:32,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374865817] [2022-11-20 09:33:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:32,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 463 [2022-11-20 09:33:32,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 368 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:32,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:32,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 463 [2022-11-20 09:33:32,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:40,563 INFO L130 PetriNetUnfolder]: 16691/55209 cut-off events. [2022-11-20 09:33:40,564 INFO L131 PetriNetUnfolder]: For 1608/2188 co-relation queries the response was YES. [2022-11-20 09:33:40,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78893 conditions, 55209 events. 16691/55209 cut-off events. For 1608/2188 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 761311 event pairs, 7678 based on Foata normal form. 5/48007 useless extension candidates. Maximal degree in co-relation 27795. Up to 18943 conditions per place. [2022-11-20 09:33:41,605 INFO L137 encePairwiseOnDemand]: 445/463 looper letters, 30 selfloop transitions, 6 changer transitions 59/367 dead transitions. [2022-11-20 09:33:41,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 367 transitions, 898 flow [2022-11-20 09:33:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-11-20 09:33:41,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9136069114470843 [2022-11-20 09:33:41,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-11-20 09:33:41,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-11-20 09:33:41,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:41,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-11-20 09:33:41,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,622 INFO L175 Difference]: Start difference. First operand has 375 places, 368 transitions, 799 flow. Second operand 3 states and 1269 transitions. [2022-11-20 09:33:41,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 367 transitions, 898 flow [2022-11-20 09:33:41,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 367 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:41,852 INFO L231 Difference]: Finished difference. Result has 358 places, 303 transitions, 695 flow [2022-11-20 09:33:41,852 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=358, PETRI_TRANSITIONS=303} [2022-11-20 09:33:41,853 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -60 predicate places. [2022-11-20 09:33:41,853 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 303 transitions, 695 flow [2022-11-20 09:33:41,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:41,854 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:41,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:33:41,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1253586922, now seen corresponding path program 1 times [2022-11-20 09:33:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295821973] [2022-11-20 09:33:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295821973] [2022-11-20 09:33:41,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295821973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:41,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:41,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925914200] [2022-11-20 09:33:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:41,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:41,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:41,918 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-20 09:33:41,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 303 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:41,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:41,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-20 09:33:41,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:43,736 INFO L130 PetriNetUnfolder]: 1592/7175 cut-off events. [2022-11-20 09:33:43,736 INFO L131 PetriNetUnfolder]: For 37/57 co-relation queries the response was YES. [2022-11-20 09:33:43,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 7175 events. 1592/7175 cut-off events. For 37/57 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 77355 event pairs, 442 based on Foata normal form. 0/6037 useless extension candidates. Maximal degree in co-relation 5406. Up to 1524 conditions per place. [2022-11-20 09:33:43,814 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-20 09:33:43,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 770 flow [2022-11-20 09:33:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-20 09:33:43,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-20 09:33:43,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-20 09:33:43,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-20 09:33:43,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:43,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-20 09:33:43,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,826 INFO L175 Difference]: Start difference. First operand has 358 places, 303 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-11-20 09:33:43,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 770 flow [2022-11-20 09:33:43,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 307 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:33:43,835 INFO L231 Difference]: Finished difference. Result has 306 places, 302 transitions, 697 flow [2022-11-20 09:33:43,836 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=306, PETRI_TRANSITIONS=302} [2022-11-20 09:33:43,836 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -112 predicate places. [2022-11-20 09:33:43,836 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 302 transitions, 697 flow [2022-11-20 09:33:43,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,837 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:43,837 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:43,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:33:43,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1568621509, now seen corresponding path program 1 times [2022-11-20 09:33:43,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:43,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957805772] [2022-11-20 09:33:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:43,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:43,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957805772] [2022-11-20 09:33:43,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957805772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:43,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:43,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911848844] [2022-11-20 09:33:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:43,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:43,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:43,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:43,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-20 09:33:43,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:43,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:43,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-20 09:33:43,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:45,568 INFO L130 PetriNetUnfolder]: 2189/8489 cut-off events. [2022-11-20 09:33:45,569 INFO L131 PetriNetUnfolder]: For 89/117 co-relation queries the response was YES. [2022-11-20 09:33:45,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13097 conditions, 8489 events. 2189/8489 cut-off events. For 89/117 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 92735 event pairs, 838 based on Foata normal form. 0/7379 useless extension candidates. Maximal degree in co-relation 12747. Up to 1755 conditions per place. [2022-11-20 09:33:45,679 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-11-20 09:33:45,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 772 flow [2022-11-20 09:33:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-20 09:33:45,683 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-20 09:33:45,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-20 09:33:45,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-20 09:33:45,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:45,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-20 09:33:45,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,692 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 697 flow. Second operand 3 states and 1279 transitions. [2022-11-20 09:33:45,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 772 flow [2022-11-20 09:33:45,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:45,701 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 695 flow [2022-11-20 09:33:45,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2022-11-20 09:33:45,702 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -113 predicate places. [2022-11-20 09:33:45,703 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 695 flow [2022-11-20 09:33:45,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:45,704 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:45,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:33:45,704 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1789669962, now seen corresponding path program 1 times [2022-11-20 09:33:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:45,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473930179] [2022-11-20 09:33:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473930179] [2022-11-20 09:33:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473930179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:45,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748390818] [2022-11-20 09:33:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:45,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:45,775 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-20 09:33:45,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:45,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:45,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-20 09:33:45,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:46,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [42#L41-5true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-20 09:33:46,528 INFO L383 tUnfolder$Statistics]: this new event has 134 ancestors and is cut-off event [2022-11-20 09:33:46,529 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-20 09:33:46,529 INFO L386 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-11-20 09:33:46,529 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:46,584 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 514#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:46,585 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-20 09:33:46,585 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 09:33:46,585 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-20 09:33:46,585 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-20 09:33:46,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-20 09:33:46,926 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-20 09:33:46,926 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-20 09:33:46,926 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-20 09:33:46,926 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-20 09:33:46,977 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 268#L107-4true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:46,977 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-20 09:33:46,978 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-20 09:33:46,978 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-20 09:33:46,978 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-20 09:33:46,996 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:46,996 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [42#L41-5true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-20 09:33:46,997 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:46,997 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-20 09:33:46,997 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-20 09:33:46,998 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-20 09:33:46,998 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 09:33:46,998 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:46,999 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-20 09:33:46,999 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:46,999 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 09:33:46,999 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 09:33:46,999 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 09:33:47,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 514#true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 509#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true, 228#L73-5true]) [2022-11-20 09:33:47,058 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-20 09:33:47,058 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-20 09:33:47,059 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-20 09:33:47,059 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 09:33:47,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:47,195 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-20 09:33:47,195 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 09:33:47,196 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-20 09:33:47,196 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 09:33:47,236 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:47,236 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-20 09:33:47,236 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 09:33:47,236 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 09:33:47,236 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 09:33:47,236 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-20 09:33:47,236 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-20 09:33:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-20 09:33:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-20 09:33:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-20 09:33:47,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:47,237 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-20 09:33:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-20 09:33:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:47,238 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-20 09:33:47,238 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 528#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:47,239 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-20 09:33:47,239 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-20 09:33:47,239 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-20 09:33:47,239 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:47,239 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-20 09:33:47,286 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 228#L73-5true, 330#L57-2true]) [2022-11-20 09:33:47,287 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-20 09:33:47,287 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 09:33:47,287 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 09:33:47,287 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 09:33:47,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:47,455 INFO L383 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-11-20 09:33:47,455 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 09:33:47,455 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-20 09:33:47,455 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-20 09:33:47,522 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][145], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 528#true, 380#L81-2true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:47,523 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-20 09:33:47,523 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 09:33:47,523 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 09:33:47,523 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-20 09:33:47,523 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 09:33:47,897 INFO L130 PetriNetUnfolder]: 2457/11284 cut-off events. [2022-11-20 09:33:47,897 INFO L131 PetriNetUnfolder]: For 414/514 co-relation queries the response was YES. [2022-11-20 09:33:48,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 11284 events. 2457/11284 cut-off events. For 414/514 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 131015 event pairs, 819 based on Foata normal form. 0/9794 useless extension candidates. Maximal degree in co-relation 15282. Up to 2051 conditions per place. [2022-11-20 09:33:48,114 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-20 09:33:48,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 770 flow [2022-11-20 09:33:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-20 09:33:48,119 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-20 09:33:48,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-20 09:33:48,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-20 09:33:48,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:48,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-20 09:33:48,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,127 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-11-20 09:33:48,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 770 flow [2022-11-20 09:33:48,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:48,139 INFO L231 Difference]: Finished difference. Result has 304 places, 300 transitions, 693 flow [2022-11-20 09:33:48,140 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=304, PETRI_TRANSITIONS=300} [2022-11-20 09:33:48,141 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-11-20 09:33:48,141 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 300 transitions, 693 flow [2022-11-20 09:33:48,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,141 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:48,142 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:48,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:33:48,142 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash -187429401, now seen corresponding path program 1 times [2022-11-20 09:33:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:48,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110888350] [2022-11-20 09:33:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110888350] [2022-11-20 09:33:48,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110888350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:48,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:48,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619277066] [2022-11-20 09:33:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:48,204 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-20 09:33:48,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 300 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:48,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:48,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-20 09:33:48,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:49,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:49,382 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-20 09:33:49,383 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-20 09:33:49,383 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-20 09:33:49,383 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-20 09:33:49,441 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, 410#L41-2true, Black: 489#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, Black: 499#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:49,441 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-20 09:33:49,441 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-20 09:33:49,442 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-20 09:33:49,442 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-20 09:33:49,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, 362#L73-2true, Black: 519#true, Black: 489#true, 514#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:49,556 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-20 09:33:49,556 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 09:33:49,556 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:49,557 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-20 09:33:49,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 410#L41-2true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, Black: 499#true, 242#L65-2true, 380#L81-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:49,603 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-20 09:33:49,603 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-20 09:33:49,603 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-20 09:33:49,603 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 09:33:49,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 536#true, 69#L49-5true, Black: 494#true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:49,650 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-20 09:33:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-20 09:33:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-20 09:33:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-20 09:33:49,754 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L65-1-->L65-2: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][173], [Black: 509#true, 42#L41-5true, Black: 514#true, 362#L73-2true, Black: 519#true, Black: 489#true, 536#true, Black: 494#true, 297#L49-2true, 291#L108-4true, 398#L81-5true, Black: 499#true, 242#L65-2true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true, 330#L57-2true]) [2022-11-20 09:33:49,754 INFO L383 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-11-20 09:33:49,754 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-20 09:33:49,754 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-20 09:33:49,754 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-20 09:33:50,412 INFO L130 PetriNetUnfolder]: 2207/9806 cut-off events. [2022-11-20 09:33:50,412 INFO L131 PetriNetUnfolder]: For 453/537 co-relation queries the response was YES. [2022-11-20 09:33:50,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14379 conditions, 9806 events. 2207/9806 cut-off events. For 453/537 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 109691 event pairs, 740 based on Foata normal form. 0/8494 useless extension candidates. Maximal degree in co-relation 13765. Up to 1834 conditions per place. [2022-11-20 09:33:50,523 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2022-11-20 09:33:50,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 768 flow [2022-11-20 09:33:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-20 09:33:50,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-20 09:33:50,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-20 09:33:50,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-20 09:33:50,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:50,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-20 09:33:50,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:50,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:50,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:50,536 INFO L175 Difference]: Start difference. First operand has 304 places, 300 transitions, 693 flow. Second operand 3 states and 1279 transitions. [2022-11-20 09:33:50,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 768 flow [2022-11-20 09:33:50,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:50,547 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 691 flow [2022-11-20 09:33:50,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-11-20 09:33:50,548 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-20 09:33:50,548 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 691 flow [2022-11-20 09:33:50,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:50,549 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:50,549 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:50,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:33:50,549 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash -260389847, now seen corresponding path program 1 times [2022-11-20 09:33:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:50,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019532576] [2022-11-20 09:33:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:50,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019532576] [2022-11-20 09:33:50,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019532576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:50,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:50,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497379415] [2022-11-20 09:33:50,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:50,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:50,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-20 09:33:50,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:50,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:50,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-20 09:33:50,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:52,237 INFO L130 PetriNetUnfolder]: 1821/7649 cut-off events. [2022-11-20 09:33:52,237 INFO L131 PetriNetUnfolder]: For 457/521 co-relation queries the response was YES. [2022-11-20 09:33:52,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11072 conditions, 7649 events. 1821/7649 cut-off events. For 457/521 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 78553 event pairs, 612 based on Foata normal form. 0/6569 useless extension candidates. Maximal degree in co-relation 10251. Up to 1594 conditions per place. [2022-11-20 09:33:52,342 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-11-20 09:33:52,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 303 transitions, 766 flow [2022-11-20 09:33:52,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-20 09:33:52,346 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-20 09:33:52,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-20 09:33:52,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-20 09:33:52,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:52,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-20 09:33:52,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:52,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:52,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:52,354 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-11-20 09:33:52,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 303 transitions, 766 flow [2022-11-20 09:33:52,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 303 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:52,366 INFO L231 Difference]: Finished difference. Result has 302 places, 298 transitions, 689 flow [2022-11-20 09:33:52,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=302, PETRI_TRANSITIONS=298} [2022-11-20 09:33:52,367 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -116 predicate places. [2022-11-20 09:33:52,367 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 298 transitions, 689 flow [2022-11-20 09:33:52,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:52,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:52,368 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:52,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:33:52,368 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1626420513, now seen corresponding path program 1 times [2022-11-20 09:33:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:52,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69758521] [2022-11-20 09:33:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:52,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:52,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69758521] [2022-11-20 09:33:52,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69758521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:52,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:52,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:33:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073988151] [2022-11-20 09:33:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:52,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:33:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:33:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:33:52,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:33:52,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 298 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:52,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:52,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:33:52,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:54,060 INFO L130 PetriNetUnfolder]: 952/4738 cut-off events. [2022-11-20 09:33:54,061 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-20 09:33:54,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 4738 events. 952/4738 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 44102 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6281. Up to 1060 conditions per place. [2022-11-20 09:33:54,135 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 46 selfloop transitions, 4 changer transitions 0/297 dead transitions. [2022-11-20 09:33:54,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 787 flow [2022-11-20 09:33:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:33:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:33:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2451 transitions. [2022-11-20 09:33:54,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8822894168466523 [2022-11-20 09:33:54,141 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2451 transitions. [2022-11-20 09:33:54,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2451 transitions. [2022-11-20 09:33:54,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:54,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2451 transitions. [2022-11-20 09:33:54,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.5) internal successors, (2451), 6 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:54,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:54,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:54,154 INFO L175 Difference]: Start difference. First operand has 302 places, 298 transitions, 689 flow. Second operand 6 states and 2451 transitions. [2022-11-20 09:33:54,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 787 flow [2022-11-20 09:33:54,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:54,162 INFO L231 Difference]: Finished difference. Result has 304 places, 297 transitions, 691 flow [2022-11-20 09:33:54,163 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2022-11-20 09:33:54,163 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-11-20 09:33:54,163 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 691 flow [2022-11-20 09:33:54,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:54,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:54,165 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 09:33:54,165 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1800624235, now seen corresponding path program 1 times [2022-11-20 09:33:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935922979] [2022-11-20 09:33:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935922979] [2022-11-20 09:33:54,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935922979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:54,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:54,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905919825] [2022-11-20 09:33:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:54,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:54,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:54,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:54,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-11-20 09:33:54,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:54,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:54,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-11-20 09:33:54,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:55,775 INFO L130 PetriNetUnfolder]: 1513/6421 cut-off events. [2022-11-20 09:33:55,775 INFO L131 PetriNetUnfolder]: For 377/425 co-relation queries the response was YES. [2022-11-20 09:33:55,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9078 conditions, 6421 events. 1513/6421 cut-off events. For 377/425 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 62242 event pairs, 504 based on Foata normal form. 0/5521 useless extension candidates. Maximal degree in co-relation 5845. Up to 1327 conditions per place. [2022-11-20 09:33:55,897 INFO L137 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-20 09:33:55,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 301 transitions, 766 flow [2022-11-20 09:33:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:33:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-20 09:33:55,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-11-20 09:33:55,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-20 09:33:55,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-20 09:33:55,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:55,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-20 09:33:55,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:55,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:55,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:55,909 INFO L175 Difference]: Start difference. First operand has 304 places, 297 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-11-20 09:33:55,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 301 transitions, 766 flow [2022-11-20 09:33:55,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 759 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:33:55,918 INFO L231 Difference]: Finished difference. Result has 301 places, 296 transitions, 686 flow [2022-11-20 09:33:55,919 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2022-11-20 09:33:55,919 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -117 predicate places. [2022-11-20 09:33:55,919 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 686 flow [2022-11-20 09:33:55,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:55,920 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:55,921 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:55,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 09:33:55,921 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1746432846, now seen corresponding path program 1 times [2022-11-20 09:33:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874788102] [2022-11-20 09:33:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:56,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874788102] [2022-11-20 09:33:56,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874788102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:56,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:56,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:33:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508139357] [2022-11-20 09:33:56,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:56,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:33:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:33:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:33:56,588 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:33:56,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:56,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:56,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:33:56,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:57,647 INFO L130 PetriNetUnfolder]: 952/4726 cut-off events. [2022-11-20 09:33:57,648 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-20 09:33:57,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 4726 events. 952/4726 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43931 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6325. Up to 1060 conditions per place. [2022-11-20 09:33:57,712 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 45 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-11-20 09:33:57,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 295 transitions, 782 flow [2022-11-20 09:33:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:33:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:33:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2450 transitions. [2022-11-20 09:33:57,718 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8819294456443485 [2022-11-20 09:33:57,718 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2450 transitions. [2022-11-20 09:33:57,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2450 transitions. [2022-11-20 09:33:57,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:57,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2450 transitions. [2022-11-20 09:33:57,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.3333333333333) internal successors, (2450), 6 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:57,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:57,732 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:57,732 INFO L175 Difference]: Start difference. First operand has 301 places, 296 transitions, 686 flow. Second operand 6 states and 2450 transitions. [2022-11-20 09:33:57,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 295 transitions, 782 flow [2022-11-20 09:33:57,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:33:57,740 INFO L231 Difference]: Finished difference. Result has 303 places, 295 transitions, 688 flow [2022-11-20 09:33:57,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=303, PETRI_TRANSITIONS=295} [2022-11-20 09:33:57,741 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-20 09:33:57,741 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 295 transitions, 688 flow [2022-11-20 09:33:57,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:57,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:57,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 09:33:57,744 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1365575655, now seen corresponding path program 1 times [2022-11-20 09:33:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:57,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100038096] [2022-11-20 09:33:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:58,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:58,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100038096] [2022-11-20 09:33:58,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100038096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:58,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:58,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:33:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561262815] [2022-11-20 09:33:58,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:33:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:58,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:33:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:33:58,295 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:33:58,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 295 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:58,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:58,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:33:58,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:59,364 INFO L130 PetriNetUnfolder]: 952/4706 cut-off events. [2022-11-20 09:33:59,364 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 09:33:59,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6551 conditions, 4706 events. 952/4706 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43707 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 5817. Up to 1060 conditions per place. [2022-11-20 09:33:59,447 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 44 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-11-20 09:33:59,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 782 flow [2022-11-20 09:33:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:33:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:33:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2449 transitions. [2022-11-20 09:33:59,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8815694744420446 [2022-11-20 09:33:59,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2449 transitions. [2022-11-20 09:33:59,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2449 transitions. [2022-11-20 09:33:59,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:59,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2449 transitions. [2022-11-20 09:33:59,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.1666666666667) internal successors, (2449), 6 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:59,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:59,467 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:59,468 INFO L175 Difference]: Start difference. First operand has 303 places, 295 transitions, 688 flow. Second operand 6 states and 2449 transitions. [2022-11-20 09:33:59,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 782 flow [2022-11-20 09:33:59,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 294 transitions, 775 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:33:59,476 INFO L231 Difference]: Finished difference. Result has 303 places, 294 transitions, 687 flow [2022-11-20 09:33:59,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=303, PETRI_TRANSITIONS=294} [2022-11-20 09:33:59,477 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-20 09:33:59,477 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 294 transitions, 687 flow [2022-11-20 09:33:59,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:59,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:59,479 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:59,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 09:33:59,479 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:33:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 583830433, now seen corresponding path program 1 times [2022-11-20 09:33:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:59,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680281276] [2022-11-20 09:33:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:34:00,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:00,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680281276] [2022-11-20 09:34:00,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680281276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:00,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:00,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:34:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058514459] [2022-11-20 09:34:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:00,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:34:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:00,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:34:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:00,105 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:34:00,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 294 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:00,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:00,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:34:00,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:00,978 INFO L130 PetriNetUnfolder]: 952/4692 cut-off events. [2022-11-20 09:34:00,979 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 09:34:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6585 conditions, 4692 events. 952/4692 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43588 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 5941. Up to 1060 conditions per place. [2022-11-20 09:34:01,035 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 43 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2022-11-20 09:34:01,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 293 transitions, 779 flow [2022-11-20 09:34:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:34:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:34:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2448 transitions. [2022-11-20 09:34:01,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8812095032397408 [2022-11-20 09:34:01,039 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2448 transitions. [2022-11-20 09:34:01,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2448 transitions. [2022-11-20 09:34:01,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:01,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2448 transitions. [2022-11-20 09:34:01,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.0) internal successors, (2448), 6 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:01,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:01,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:01,050 INFO L175 Difference]: Start difference. First operand has 303 places, 294 transitions, 687 flow. Second operand 6 states and 2448 transitions. [2022-11-20 09:34:01,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 293 transitions, 779 flow [2022-11-20 09:34:01,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 293 transitions, 772 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:34:01,058 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 686 flow [2022-11-20 09:34:01,058 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=686, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2022-11-20 09:34:01,059 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-20 09:34:01,059 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 686 flow [2022-11-20 09:34:01,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:01,060 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:01,061 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:01,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 09:34:01,061 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:34:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1508730747, now seen corresponding path program 1 times [2022-11-20 09:34:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:01,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897072648] [2022-11-20 09:34:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:34:01,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:01,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897072648] [2022-11-20 09:34:01,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897072648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:01,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:01,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:34:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149016225] [2022-11-20 09:34:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:01,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:34:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:34:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:01,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:34:01,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:01,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:01,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:34:01,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:02,491 INFO L130 PetriNetUnfolder]: 952/4686 cut-off events. [2022-11-20 09:34:02,491 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-20 09:34:02,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 4686 events. 952/4686 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43596 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6217. Up to 1060 conditions per place. [2022-11-20 09:34:02,556 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 42 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-11-20 09:34:02,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 292 transitions, 776 flow [2022-11-20 09:34:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:34:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:34:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2022-11-20 09:34:02,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.880849532037437 [2022-11-20 09:34:02,564 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2447 transitions. [2022-11-20 09:34:02,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2447 transitions. [2022-11-20 09:34:02,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:02,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2447 transitions. [2022-11-20 09:34:02,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.8333333333333) internal successors, (2447), 6 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:02,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:02,572 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:02,572 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 686 flow. Second operand 6 states and 2447 transitions. [2022-11-20 09:34:02,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 292 transitions, 776 flow [2022-11-20 09:34:02,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 292 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:34:02,580 INFO L231 Difference]: Finished difference. Result has 303 places, 292 transitions, 685 flow [2022-11-20 09:34:02,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=303, PETRI_TRANSITIONS=292} [2022-11-20 09:34:02,581 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-20 09:34:02,582 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 292 transitions, 685 flow [2022-11-20 09:34:02,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:02,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:34:02,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:02,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 09:34:02,583 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-11-20 09:34:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2091707096, now seen corresponding path program 1 times [2022-11-20 09:34:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:02,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861163675] [2022-11-20 09:34:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:34:03,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:03,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861163675] [2022-11-20 09:34:03,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861163675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:03,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:03,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:34:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454854295] [2022-11-20 09:34:03,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:03,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:34:03,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:34:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:03,301 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-11-20 09:34:03,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 292 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:03,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:34:03,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-11-20 09:34:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:34:04,277 INFO L130 PetriNetUnfolder]: 952/4683 cut-off events. [2022-11-20 09:34:04,278 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 09:34:04,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6534 conditions, 4683 events. 952/4683 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 43568 event pairs, 172 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 6395. Up to 1060 conditions per place. [2022-11-20 09:34:04,324 INFO L137 encePairwiseOnDemand]: 458/463 looper letters, 0 selfloop transitions, 0 changer transitions 291/291 dead transitions. [2022-11-20 09:34:04,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 291 transitions, 773 flow [2022-11-20 09:34:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:34:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:34:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2446 transitions. [2022-11-20 09:34:04,333 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8804895608351332 [2022-11-20 09:34:04,333 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2446 transitions. [2022-11-20 09:34:04,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2446 transitions. [2022-11-20 09:34:04,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:34:04,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2446 transitions. [2022-11-20 09:34:04,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.6666666666667) internal successors, (2446), 6 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:04,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:04,342 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:04,342 INFO L175 Difference]: Start difference. First operand has 303 places, 292 transitions, 685 flow. Second operand 6 states and 2446 transitions. [2022-11-20 09:34:04,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 291 transitions, 773 flow [2022-11-20 09:34:04,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 291 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:34:04,349 INFO L231 Difference]: Finished difference. Result has 303 places, 0 transitions, 0 flow [2022-11-20 09:34:04,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=303, PETRI_TRANSITIONS=0} [2022-11-20 09:34:04,350 INFO L288 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-11-20 09:34:04,350 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 0 transitions, 0 flow [2022-11-20 09:34:04,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:04,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (102 of 103 remaining) [2022-11-20 09:34:04,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (101 of 103 remaining) [2022-11-20 09:34:04,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (100 of 103 remaining) [2022-11-20 09:34:04,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 103 remaining) [2022-11-20 09:34:04,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 103 remaining) [2022-11-20 09:34:04,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (97 of 103 remaining) [2022-11-20 09:34:04,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 103 remaining) [2022-11-20 09:34:04,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 103 remaining) [2022-11-20 09:34:04,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (94 of 103 remaining) [2022-11-20 09:34:04,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 103 remaining) [2022-11-20 09:34:04,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 103 remaining) [2022-11-20 09:34:04,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 103 remaining) [2022-11-20 09:34:04,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 103 remaining) [2022-11-20 09:34:04,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 103 remaining) [2022-11-20 09:34:04,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 103 remaining) [2022-11-20 09:34:04,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 103 remaining) [2022-11-20 09:34:04,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 103 remaining) [2022-11-20 09:34:04,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 103 remaining) [2022-11-20 09:34:04,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 103 remaining) [2022-11-20 09:34:04,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (83 of 103 remaining) [2022-11-20 09:34:04,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (82 of 103 remaining) [2022-11-20 09:34:04,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 103 remaining) [2022-11-20 09:34:04,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 103 remaining) [2022-11-20 09:34:04,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 103 remaining) [2022-11-20 09:34:04,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 103 remaining) [2022-11-20 09:34:04,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (77 of 103 remaining) [2022-11-20 09:34:04,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 103 remaining) [2022-11-20 09:34:04,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (75 of 103 remaining) [2022-11-20 09:34:04,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (74 of 103 remaining) [2022-11-20 09:34:04,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 103 remaining) [2022-11-20 09:34:04,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 103 remaining) [2022-11-20 09:34:04,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (71 of 103 remaining) [2022-11-20 09:34:04,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (70 of 103 remaining) [2022-11-20 09:34:04,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 103 remaining) [2022-11-20 09:34:04,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (68 of 103 remaining) [2022-11-20 09:34:04,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 103 remaining) [2022-11-20 09:34:04,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (66 of 103 remaining) [2022-11-20 09:34:04,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (65 of 103 remaining) [2022-11-20 09:34:04,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (64 of 103 remaining) [2022-11-20 09:34:04,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 103 remaining) [2022-11-20 09:34:04,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (62 of 103 remaining) [2022-11-20 09:34:04,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (61 of 103 remaining) [2022-11-20 09:34:04,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (60 of 103 remaining) [2022-11-20 09:34:04,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (59 of 103 remaining) [2022-11-20 09:34:04,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (58 of 103 remaining) [2022-11-20 09:34:04,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (57 of 103 remaining) [2022-11-20 09:34:04,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (56 of 103 remaining) [2022-11-20 09:34:04,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (55 of 103 remaining) [2022-11-20 09:34:04,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (54 of 103 remaining) [2022-11-20 09:34:04,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (53 of 103 remaining) [2022-11-20 09:34:04,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (52 of 103 remaining) [2022-11-20 09:34:04,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (51 of 103 remaining) [2022-11-20 09:34:04,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 103 remaining) [2022-11-20 09:34:04,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 103 remaining) [2022-11-20 09:34:04,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 103 remaining) [2022-11-20 09:34:04,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 103 remaining) [2022-11-20 09:34:04,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 103 remaining) [2022-11-20 09:34:04,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 103 remaining) [2022-11-20 09:34:04,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 103 remaining) [2022-11-20 09:34:04,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 103 remaining) [2022-11-20 09:34:04,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 103 remaining) [2022-11-20 09:34:04,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 103 remaining) [2022-11-20 09:34:04,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 103 remaining) [2022-11-20 09:34:04,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 103 remaining) [2022-11-20 09:34:04,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 103 remaining) [2022-11-20 09:34:04,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 103 remaining) [2022-11-20 09:34:04,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 103 remaining) [2022-11-20 09:34:04,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 103 remaining) [2022-11-20 09:34:04,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 103 remaining) [2022-11-20 09:34:04,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 103 remaining) [2022-11-20 09:34:04,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 103 remaining) [2022-11-20 09:34:04,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 103 remaining) [2022-11-20 09:34:04,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 103 remaining) [2022-11-20 09:34:04,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 103 remaining) [2022-11-20 09:34:04,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 103 remaining) [2022-11-20 09:34:04,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 103 remaining) [2022-11-20 09:34:04,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 103 remaining) [2022-11-20 09:34:04,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 103 remaining) [2022-11-20 09:34:04,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 103 remaining) [2022-11-20 09:34:04,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 103 remaining) [2022-11-20 09:34:04,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 103 remaining) [2022-11-20 09:34:04,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 103 remaining) [2022-11-20 09:34:04,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 103 remaining) [2022-11-20 09:34:04,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 103 remaining) [2022-11-20 09:34:04,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 103 remaining) [2022-11-20 09:34:04,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 103 remaining) [2022-11-20 09:34:04,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 103 remaining) [2022-11-20 09:34:04,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 103 remaining) [2022-11-20 09:34:04,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 103 remaining) [2022-11-20 09:34:04,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 103 remaining) [2022-11-20 09:34:04,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 103 remaining) [2022-11-20 09:34:04,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 103 remaining) [2022-11-20 09:34:04,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 103 remaining) [2022-11-20 09:34:04,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 103 remaining) [2022-11-20 09:34:04,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 103 remaining) [2022-11-20 09:34:04,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 103 remaining) [2022-11-20 09:34:04,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 103 remaining) [2022-11-20 09:34:04,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 103 remaining) [2022-11-20 09:34:04,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 103 remaining) [2022-11-20 09:34:04,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 103 remaining) [2022-11-20 09:34:04,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 103 remaining) [2022-11-20 09:34:04,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 103 remaining) [2022-11-20 09:34:04,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 103 remaining) [2022-11-20 09:34:04,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 09:34:04,378 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:04,385 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:34:04,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:34:04,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:34:04 BasicIcfg [2022-11-20 09:34:04,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:34:04,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:34:04,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:34:04,392 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:34:04,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:10" (3/4) ... [2022-11-20 09:34:04,395 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 09:34:04,401 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-20 09:34:04,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-20 09:34:04,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-20 09:34:04,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-20 09:34:04,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2022-11-20 09:34:04,403 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2022-11-20 09:34:04,410 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-20 09:34:04,411 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 09:34:04,411 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 09:34:04,412 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 09:34:04,489 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:34:04,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:34:04,490 INFO L158 Benchmark]: Toolchain (without parser) took 55179.00ms. Allocated memory was 169.9MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 141.7MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-11-20 09:34:04,490 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory was 98.7MB in the beginning and 98.7MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:34:04,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.41ms. Allocated memory is still 169.9MB. Free memory was 141.7MB in the beginning and 128.9MB in the end (delta: 12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:34:04,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.83ms. Allocated memory is still 169.9MB. Free memory was 128.9MB in the beginning and 126.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:34:04,492 INFO L158 Benchmark]: Boogie Preprocessor took 87.22ms. Allocated memory is still 169.9MB. Free memory was 126.2MB in the beginning and 123.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:34:04,492 INFO L158 Benchmark]: RCFGBuilder took 1096.89ms. Allocated memory is still 169.9MB. Free memory was 123.8MB in the beginning and 92.0MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 09:34:04,493 INFO L158 Benchmark]: TraceAbstraction took 53509.94ms. Allocated memory was 169.9MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 91.4MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-20 09:34:04,493 INFO L158 Benchmark]: Witness Printer took 98.05ms. Allocated memory is still 13.1GB. Free memory was 10.1GB in the beginning and 10.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 09:34:04,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory was 98.7MB in the beginning and 98.7MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.41ms. Allocated memory is still 169.9MB. Free memory was 141.7MB in the beginning and 128.9MB in the end (delta: 12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.83ms. Allocated memory is still 169.9MB. Free memory was 128.9MB in the beginning and 126.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.22ms. Allocated memory is still 169.9MB. Free memory was 126.2MB in the beginning and 123.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1096.89ms. Allocated memory is still 169.9MB. Free memory was 123.8MB in the beginning and 92.0MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 53509.94ms. Allocated memory was 169.9MB in the beginning and 13.1GB in the end (delta: 12.9GB). Free memory was 91.4MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 98.05ms. Allocated memory is still 13.1GB. Free memory was 10.1GB in the beginning and 10.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 578 locations, 103 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.3s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 47.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 462 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 462 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2533 NumberOfCodeBlocks, 2533 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2507 ConstructedInterpolants, 0 QuantifiedInterpolants, 3033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 09:34:04,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226c0b01-21cb-4f16-99b0-a8838be9e0e1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE