./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i --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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/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 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 --- 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 10:34:32,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:34:32,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:34:32,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:34:32,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:34:32,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:34:32,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:34:32,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:34:32,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:34:32,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:34:32,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:34:32,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:34:32,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:34:32,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:34:32,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:34:32,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:34:32,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:34:32,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:34:32,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:34:32,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:34:32,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:34:32,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:34:32,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:34:32,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:34:32,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:34:32,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:34:32,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:34:32,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:34:32,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:34:32,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:34:32,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:34:32,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:34:32,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:34:32,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:34:32,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:34:32,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:34:32,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:34:32,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:34:32,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:34:32,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:34:32,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:34:32,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 10:34:32,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:34:32,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:34:32,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:34:32,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:34:32,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:34:32,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:34:32,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:34:32,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:34:32,628 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:34:32,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:34:32,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:34:32,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:34:32,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:34:32,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:34:32,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:34:32,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:34:32,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:34:32,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:34:32,630 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 10:34:32,631 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:34:32,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:34:32,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:34:32,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:34:32,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:34:32,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:34:32,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:34:32,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:34:32,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:34:32,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:34:32,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:34:32,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:34:32,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:34:32,634 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:34:32,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:34:32,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:34:32,634 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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/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 -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2022-11-20 10:34:32,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:34:32,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:34:32,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:34:32,962 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:34:32,962 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:34:32,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2022-11-20 10:34:36,109 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:34:36,476 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:34:36,477 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2022-11-20 10:34:36,511 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/data/1f78c1983/e7c3017022cd430480389bb3b3762a2c/FLAGd2c9a3bf6 [2022-11-20 10:34:36,526 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/data/1f78c1983/e7c3017022cd430480389bb3b3762a2c [2022-11-20 10:34:36,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:34:36,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:34:36,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:34:36,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:34:36,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:34:36,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:34:36" (1/1) ... [2022-11-20 10:34:36,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d19a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:36, skipping insertion in model container [2022-11-20 10:34:36,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:34:36" (1/1) ... [2022-11-20 10:34:36,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:34:36,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:34:37,382 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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i[76081,76094] [2022-11-20 10:34:37,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:34:37,457 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:34:37,546 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_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i[76081,76094] [2022-11-20 10:34:37,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:34:37,728 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:34:37,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37 WrapperNode [2022-11-20 10:34:37,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:34:37,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:34:37,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:34:37,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:34:37,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,803 INFO L138 Inliner]: procedures = 486, calls = 44, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-11-20 10:34:37,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:34:37,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:34:37,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:34:37,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:34:37,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,885 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:34:37,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:34:37,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:34:37,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:34:37,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (1/1) ... [2022-11-20 10:34:37,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:34:37,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:37,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:34:38,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:34:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2022-11-20 10:34:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2022-11-20 10:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:34:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2022-11-20 10:34:38,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2022-11-20 10:34:38,050 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 10:34:38,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:34:38,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:34:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:34:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:34:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:34:38,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:34:38,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:34:38,054 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 10:34:38,467 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:34:38,469 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:34:38,969 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:34:38,984 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:34:38,984 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:34:38,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:38 BoogieIcfgContainer [2022-11-20 10:34:38,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:34:38,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:34:38,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:34:38,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:34:38,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:34:36" (1/3) ... [2022-11-20 10:34:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d8847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:34:38, skipping insertion in model container [2022-11-20 10:34:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:37" (2/3) ... [2022-11-20 10:34:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d8847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:34:38, skipping insertion in model container [2022-11-20 10:34:38,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:38" (3/3) ... [2022-11-20 10:34:39,000 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2022-11-20 10:34:39,011 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:34:39,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:34:39,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-20 10:34:39,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:34:39,235 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-11-20 10:34:39,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 452 places, 484 transitions, 998 flow [2022-11-20 10:34:39,482 INFO L130 PetriNetUnfolder]: 35/495 cut-off events. [2022-11-20 10:34:39,483 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 10:34:39,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 495 events. 35/495 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1384 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 348. Up to 11 conditions per place. [2022-11-20 10:34:39,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 452 places, 484 transitions, 998 flow [2022-11-20 10:34:39,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 310 places, 328 transitions, 673 flow [2022-11-20 10:34:39,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:34:39,548 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;@481e9bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:34:39,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-11-20 10:34:39,568 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-11-20 10:34:39,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:34:39,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:39,569 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 10:34:39,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash -718903709, now seen corresponding path program 1 times [2022-11-20 10:34:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:39,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129510382] [2022-11-20 10:34:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:39,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:40,189 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 10:34:40,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:40,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129510382] [2022-11-20 10:34:40,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129510382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:40,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:40,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276213969] [2022-11-20 10:34:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:40,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:40,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:40,280 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-20 10:34:40,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 328 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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 10:34:40,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:40,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-20 10:34:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:40,935 INFO L130 PetriNetUnfolder]: 211/1611 cut-off events. [2022-11-20 10:34:40,936 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-11-20 10:34:40,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1611 events. 211/1611 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10515 event pairs, 114 based on Foata normal form. 74/1398 useless extension candidates. Maximal degree in co-relation 1626. Up to 328 conditions per place. [2022-11-20 10:34:40,969 INFO L137 encePairwiseOnDemand]: 470/484 looper letters, 47 selfloop transitions, 2 changer transitions 2/309 dead transitions. [2022-11-20 10:34:40,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 309 transitions, 733 flow [2022-11-20 10:34:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2022-11-20 10:34:41,001 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8415977961432507 [2022-11-20 10:34:41,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1222 transitions. [2022-11-20 10:34:41,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1222 transitions. [2022-11-20 10:34:41,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:41,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1222 transitions. [2022-11-20 10:34:41,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 0 states have call successors, (0), 0 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 10:34:41,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:41,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:41,045 INFO L175 Difference]: Start difference. First operand has 310 places, 328 transitions, 673 flow. Second operand 3 states and 1222 transitions. [2022-11-20 10:34:41,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 309 transitions, 733 flow [2022-11-20 10:34:41,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 309 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:41,068 INFO L231 Difference]: Finished difference. Result has 302 places, 307 transitions, 631 flow [2022-11-20 10:34:41,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=307} [2022-11-20 10:34:41,078 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2022-11-20 10:34:41,079 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 307 transitions, 631 flow [2022-11-20 10:34:41,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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 10:34:41,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:41,081 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] [2022-11-20 10:34:41,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:34:41,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2142060844, now seen corresponding path program 1 times [2022-11-20 10:34:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:41,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23915239] [2022-11-20 10:34:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:41,298 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 10:34:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:41,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23915239] [2022-11-20 10:34:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23915239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:41,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:41,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366200475] [2022-11-20 10:34:41,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:41,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:41,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 484 [2022-11-20 10:34:41,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 307 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 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 10:34:41,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:41,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 484 [2022-11-20 10:34:41,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:41,951 INFO L130 PetriNetUnfolder]: 225/1916 cut-off events. [2022-11-20 10:34:41,951 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2022-11-20 10:34:41,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 1916 events. 225/1916 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13705 event pairs, 45 based on Foata normal form. 1/1630 useless extension candidates. Maximal degree in co-relation 2250. Up to 194 conditions per place. [2022-11-20 10:34:41,982 INFO L137 encePairwiseOnDemand]: 460/484 looper letters, 47 selfloop transitions, 17 changer transitions 0/325 dead transitions. [2022-11-20 10:34:41,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 325 transitions, 796 flow [2022-11-20 10:34:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2022-11-20 10:34:41,988 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8546831955922864 [2022-11-20 10:34:41,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1241 transitions. [2022-11-20 10:34:41,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1241 transitions. [2022-11-20 10:34:41,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:41,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1241 transitions. [2022-11-20 10:34:41,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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 10:34:41,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:42,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:42,001 INFO L175 Difference]: Start difference. First operand has 302 places, 307 transitions, 631 flow. Second operand 3 states and 1241 transitions. [2022-11-20 10:34:42,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 325 transitions, 796 flow [2022-11-20 10:34:42,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 325 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:42,016 INFO L231 Difference]: Finished difference. Result has 299 places, 316 transitions, 745 flow [2022-11-20 10:34:42,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=299, PETRI_TRANSITIONS=316} [2022-11-20 10:34:42,018 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -11 predicate places. [2022-11-20 10:34:42,019 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 316 transitions, 745 flow [2022-11-20 10:34:42,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 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 10:34:42,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:42,020 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] [2022-11-20 10:34:42,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:34:42,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1784969605, now seen corresponding path program 1 times [2022-11-20 10:34:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:42,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054999282] [2022-11-20 10:34:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:42,236 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 10:34:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:42,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054999282] [2022-11-20 10:34:42,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054999282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:42,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613819018] [2022-11-20 10:34:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:42,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-20 10:34:42,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 316 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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 10:34:42,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:42,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-20 10:34:42,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:42,762 INFO L130 PetriNetUnfolder]: 221/1786 cut-off events. [2022-11-20 10:34:42,762 INFO L131 PetriNetUnfolder]: For 370/417 co-relation queries the response was YES. [2022-11-20 10:34:42,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1786 events. 221/1786 cut-off events. For 370/417 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12278 event pairs, 74 based on Foata normal form. 0/1524 useless extension candidates. Maximal degree in co-relation 2156. Up to 359 conditions per place. [2022-11-20 10:34:42,789 INFO L137 encePairwiseOnDemand]: 481/484 looper letters, 55 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-20 10:34:42,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 315 transitions, 857 flow [2022-11-20 10:34:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2022-11-20 10:34:42,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.831267217630854 [2022-11-20 10:34:42,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2022-11-20 10:34:42,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2022-11-20 10:34:42,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:42,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2022-11-20 10:34:42,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 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 10:34:42,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:42,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:42,808 INFO L175 Difference]: Start difference. First operand has 299 places, 316 transitions, 745 flow. Second operand 3 states and 1207 transitions. [2022-11-20 10:34:42,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 315 transitions, 857 flow [2022-11-20 10:34:42,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 315 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:42,822 INFO L231 Difference]: Finished difference. Result has 298 places, 315 transitions, 713 flow [2022-11-20 10:34:42,823 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=298, PETRI_TRANSITIONS=315} [2022-11-20 10:34:42,826 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2022-11-20 10:34:42,826 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 315 transitions, 713 flow [2022-11-20 10:34:42,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 0 states have call successors, (0), 0 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 10:34:42,828 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:42,828 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] [2022-11-20 10:34:42,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:34:42,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1008465667, now seen corresponding path program 1 times [2022-11-20 10:34:42,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:42,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408760705] [2022-11-20 10:34:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:43,040 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 10:34:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:43,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408760705] [2022-11-20 10:34:43,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408760705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:43,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:43,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190854490] [2022-11-20 10:34:43,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:43,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:43,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:43,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 484 [2022-11-20 10:34:43,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 315 transitions, 713 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 10:34:43,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:43,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 484 [2022-11-20 10:34:43,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:43,433 INFO L130 PetriNetUnfolder]: 111/1326 cut-off events. [2022-11-20 10:34:43,433 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-20 10:34:43,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1326 events. 111/1326 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7949 event pairs, 13 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 1531. Up to 88 conditions per place. [2022-11-20 10:34:43,452 INFO L137 encePairwiseOnDemand]: 481/484 looper letters, 22 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-20 10:34:43,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 314 transitions, 759 flow [2022-11-20 10:34:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2022-11-20 10:34:43,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2022-11-20 10:34:43,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1270 transitions. [2022-11-20 10:34:43,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1270 transitions. [2022-11-20 10:34:43,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:43,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1270 transitions. [2022-11-20 10:34:43,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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 10:34:43,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:43,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:43,474 INFO L175 Difference]: Start difference. First operand has 298 places, 315 transitions, 713 flow. Second operand 3 states and 1270 transitions. [2022-11-20 10:34:43,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 314 transitions, 759 flow [2022-11-20 10:34:43,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 314 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:43,483 INFO L231 Difference]: Finished difference. Result has 297 places, 314 transitions, 711 flow [2022-11-20 10:34:43,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=297, PETRI_TRANSITIONS=314} [2022-11-20 10:34:43,488 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -13 predicate places. [2022-11-20 10:34:43,488 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 314 transitions, 711 flow [2022-11-20 10:34:43,489 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 10:34:43,490 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:43,490 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] [2022-11-20 10:34:43,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:34:43,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -954520180, now seen corresponding path program 1 times [2022-11-20 10:34:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:43,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716744011] [2022-11-20 10:34:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:43,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:43,641 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 10:34:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716744011] [2022-11-20 10:34:43,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716744011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:43,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:43,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753090331] [2022-11-20 10:34:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:43,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:43,647 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 484 [2022-11-20 10:34:43,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 314 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 0 states have call successors, (0), 0 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 10:34:43,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:43,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 484 [2022-11-20 10:34:43,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:44,006 INFO L130 PetriNetUnfolder]: 128/1408 cut-off events. [2022-11-20 10:34:44,006 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-20 10:34:44,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 1408 events. 128/1408 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8651 event pairs, 13 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 1545. Up to 83 conditions per place. [2022-11-20 10:34:44,022 INFO L137 encePairwiseOnDemand]: 476/484 looper letters, 17 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2022-11-20 10:34:44,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 314 transitions, 755 flow [2022-11-20 10:34:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2022-11-20 10:34:44,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2022-11-20 10:34:44,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1276 transitions. [2022-11-20 10:34:44,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1276 transitions. [2022-11-20 10:34:44,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:44,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1276 transitions. [2022-11-20 10:34:44,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:44,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:44,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:44,038 INFO L175 Difference]: Start difference. First operand has 297 places, 314 transitions, 711 flow. Second operand 3 states and 1276 transitions. [2022-11-20 10:34:44,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 314 transitions, 755 flow [2022-11-20 10:34:44,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 314 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:44,046 INFO L231 Difference]: Finished difference. Result has 295 places, 314 transitions, 728 flow [2022-11-20 10:34:44,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=295, PETRI_TRANSITIONS=314} [2022-11-20 10:34:44,047 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -15 predicate places. [2022-11-20 10:34:44,048 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 314 transitions, 728 flow [2022-11-20 10:34:44,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 0 states have call successors, (0), 0 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 10:34:44,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:44,049 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] [2022-11-20 10:34:44,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:34:44,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 139043144, now seen corresponding path program 1 times [2022-11-20 10:34:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:44,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217880619] [2022-11-20 10:34:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:44,721 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 10:34:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:44,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217880619] [2022-11-20 10:34:44,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217880619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:44,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:44,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:34:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374473873] [2022-11-20 10:34:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:34:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:44,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:34:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:34:44,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 484 [2022-11-20 10:34:44,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 314 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 429.6666666666667) internal successors, (2578), 6 states have internal predecessors, (2578), 0 states have call successors, (0), 0 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 10:34:44,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:44,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 484 [2022-11-20 10:34:44,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:45,412 INFO L130 PetriNetUnfolder]: 397/2037 cut-off events. [2022-11-20 10:34:45,413 INFO L131 PetriNetUnfolder]: For 61/90 co-relation queries the response was YES. [2022-11-20 10:34:45,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 2037 events. 397/2037 cut-off events. For 61/90 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 13504 event pairs, 51 based on Foata normal form. 20/1790 useless extension candidates. Maximal degree in co-relation 2060. Up to 171 conditions per place. [2022-11-20 10:34:45,441 INFO L137 encePairwiseOnDemand]: 479/484 looper letters, 52 selfloop transitions, 4 changer transitions 16/349 dead transitions. [2022-11-20 10:34:45,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 349 transitions, 946 flow [2022-11-20 10:34:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:34:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:34:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2625 transitions. [2022-11-20 10:34:45,449 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9039256198347108 [2022-11-20 10:34:45,449 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2625 transitions. [2022-11-20 10:34:45,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2625 transitions. [2022-11-20 10:34:45,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:45,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2625 transitions. [2022-11-20 10:34:45,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 437.5) internal successors, (2625), 6 states have internal predecessors, (2625), 0 states have call successors, (0), 0 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 10:34:45,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 484.0) internal successors, (3388), 7 states have internal predecessors, (3388), 0 states have call successors, (0), 0 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 10:34:45,469 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 484.0) internal successors, (3388), 7 states have internal predecessors, (3388), 0 states have call successors, (0), 0 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 10:34:45,470 INFO L175 Difference]: Start difference. First operand has 295 places, 314 transitions, 728 flow. Second operand 6 states and 2625 transitions. [2022-11-20 10:34:45,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 349 transitions, 946 flow [2022-11-20 10:34:45,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 349 transitions, 941 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:34:45,479 INFO L231 Difference]: Finished difference. Result has 298 places, 297 transitions, 693 flow [2022-11-20 10:34:45,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=298, PETRI_TRANSITIONS=297} [2022-11-20 10:34:45,481 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2022-11-20 10:34:45,481 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 297 transitions, 693 flow [2022-11-20 10:34:45,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 429.6666666666667) internal successors, (2578), 6 states have internal predecessors, (2578), 0 states have call successors, (0), 0 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 10:34:45,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:45,483 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] [2022-11-20 10:34:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:34:45,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -873093179, now seen corresponding path program 1 times [2022-11-20 10:34:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:45,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815335599] [2022-11-20 10:34:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:45,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 10:34:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:45,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815335599] [2022-11-20 10:34:45,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815335599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:45,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:45,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558356926] [2022-11-20 10:34:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:45,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:45,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 484 [2022-11-20 10:34:45,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 297 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 10:34:45,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:45,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 484 [2022-11-20 10:34:45,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:46,080 INFO L130 PetriNetUnfolder]: 272/1950 cut-off events. [2022-11-20 10:34:46,081 INFO L131 PetriNetUnfolder]: For 147/180 co-relation queries the response was YES. [2022-11-20 10:34:46,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 1950 events. 272/1950 cut-off events. For 147/180 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 13840 event pairs, 72 based on Foata normal form. 1/1667 useless extension candidates. Maximal degree in co-relation 2575. Up to 371 conditions per place. [2022-11-20 10:34:46,109 INFO L137 encePairwiseOnDemand]: 478/484 looper letters, 55 selfloop transitions, 7 changer transitions 1/307 dead transitions. [2022-11-20 10:34:46,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 307 transitions, 849 flow [2022-11-20 10:34:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2022-11-20 10:34:46,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8353994490358126 [2022-11-20 10:34:46,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1213 transitions. [2022-11-20 10:34:46,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1213 transitions. [2022-11-20 10:34:46,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:46,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1213 transitions. [2022-11-20 10:34:46,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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 10:34:46,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:46,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:46,123 INFO L175 Difference]: Start difference. First operand has 298 places, 297 transitions, 693 flow. Second operand 3 states and 1213 transitions. [2022-11-20 10:34:46,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 307 transitions, 849 flow [2022-11-20 10:34:46,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 307 transitions, 842 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:34:46,132 INFO L231 Difference]: Finished difference. Result has 283 places, 301 transitions, 740 flow [2022-11-20 10:34:46,133 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=283, PETRI_TRANSITIONS=301} [2022-11-20 10:34:46,134 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -27 predicate places. [2022-11-20 10:34:46,134 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 301 transitions, 740 flow [2022-11-20 10:34:46,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 10:34:46,135 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:46,135 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 10:34:46,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:34:46,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 349733646, now seen corresponding path program 1 times [2022-11-20 10:34:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:46,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883809632] [2022-11-20 10:34:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:46,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:46,292 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 10:34:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883809632] [2022-11-20 10:34:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883809632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:34:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100271913] [2022-11-20 10:34:46,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:46,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:46,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:46,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:46,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 484 [2022-11-20 10:34:46,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 301 transitions, 740 flow. Second operand has 3 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 10:34:46,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:46,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 484 [2022-11-20 10:34:46,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:46,667 INFO L130 PetriNetUnfolder]: 151/1516 cut-off events. [2022-11-20 10:34:46,668 INFO L131 PetriNetUnfolder]: For 97/105 co-relation queries the response was YES. [2022-11-20 10:34:46,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 1516 events. 151/1516 cut-off events. For 97/105 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9800 event pairs, 14 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 1812. Up to 90 conditions per place. [2022-11-20 10:34:46,688 INFO L137 encePairwiseOnDemand]: 476/484 looper letters, 13 selfloop transitions, 5 changer transitions 0/304 dead transitions. [2022-11-20 10:34:46,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 304 transitions, 782 flow [2022-11-20 10:34:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions. [2022-11-20 10:34:46,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9070247933884298 [2022-11-20 10:34:46,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1317 transitions. [2022-11-20 10:34:46,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1317 transitions. [2022-11-20 10:34:46,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:46,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1317 transitions. [2022-11-20 10:34:46,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 439.0) internal successors, (1317), 3 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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 10:34:46,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:46,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:46,704 INFO L175 Difference]: Start difference. First operand has 283 places, 301 transitions, 740 flow. Second operand 3 states and 1317 transitions. [2022-11-20 10:34:46,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 304 transitions, 782 flow [2022-11-20 10:34:46,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 304 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:46,712 INFO L231 Difference]: Finished difference. Result has 284 places, 303 transitions, 760 flow [2022-11-20 10:34:46,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=284, PETRI_TRANSITIONS=303} [2022-11-20 10:34:46,714 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -26 predicate places. [2022-11-20 10:34:46,714 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 303 transitions, 760 flow [2022-11-20 10:34:46,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 10:34:46,716 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:46,716 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] [2022-11-20 10:34:46,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:34:46,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 991462440, now seen corresponding path program 1 times [2022-11-20 10:34:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:46,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293296673] [2022-11-20 10:34:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:46,829 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 10:34:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:46,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293296673] [2022-11-20 10:34:46,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293296673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:46,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:46,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935912893] [2022-11-20 10:34:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:46,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:46,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-20 10:34:46,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 303 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 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 10:34:46,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:46,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-20 10:34:46,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:47,479 INFO L130 PetriNetUnfolder]: 392/2581 cut-off events. [2022-11-20 10:34:47,479 INFO L131 PetriNetUnfolder]: For 334/419 co-relation queries the response was YES. [2022-11-20 10:34:47,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 2581 events. 392/2581 cut-off events. For 334/419 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20232 event pairs, 90 based on Foata normal form. 4/2264 useless extension candidates. Maximal degree in co-relation 3670. Up to 467 conditions per place. [2022-11-20 10:34:47,511 INFO L137 encePairwiseOnDemand]: 474/484 looper letters, 70 selfloop transitions, 15 changer transitions 0/331 dead transitions. [2022-11-20 10:34:47,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 331 transitions, 1033 flow [2022-11-20 10:34:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2022-11-20 10:34:47,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8429752066115702 [2022-11-20 10:34:47,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1224 transitions. [2022-11-20 10:34:47,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1224 transitions. [2022-11-20 10:34:47,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:47,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1224 transitions. [2022-11-20 10:34:47,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 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 10:34:47,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:47,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:47,525 INFO L175 Difference]: Start difference. First operand has 284 places, 303 transitions, 760 flow. Second operand 3 states and 1224 transitions. [2022-11-20 10:34:47,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 331 transitions, 1033 flow [2022-11-20 10:34:47,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 331 transitions, 1023 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:47,536 INFO L231 Difference]: Finished difference. Result has 286 places, 314 transitions, 878 flow [2022-11-20 10:34:47,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=286, PETRI_TRANSITIONS=314} [2022-11-20 10:34:47,538 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -24 predicate places. [2022-11-20 10:34:47,538 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 314 transitions, 878 flow [2022-11-20 10:34:47,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 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 10:34:47,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:47,539 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] [2022-11-20 10:34:47,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:34:47,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash 678595874, now seen corresponding path program 1 times [2022-11-20 10:34:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:47,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199959944] [2022-11-20 10:34:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:47,632 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 10:34:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:47,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199959944] [2022-11-20 10:34:47,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199959944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:47,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:47,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898646206] [2022-11-20 10:34:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:47,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 484 [2022-11-20 10:34:47,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 314 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 10:34:47,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:47,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 484 [2022-11-20 10:34:47,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:48,111 INFO L130 PetriNetUnfolder]: 222/1986 cut-off events. [2022-11-20 10:34:48,111 INFO L131 PetriNetUnfolder]: For 427/469 co-relation queries the response was YES. [2022-11-20 10:34:48,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1986 events. 222/1986 cut-off events. For 427/469 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14576 event pairs, 16 based on Foata normal form. 3/1750 useless extension candidates. Maximal degree in co-relation 2734. Up to 127 conditions per place. [2022-11-20 10:34:48,134 INFO L137 encePairwiseOnDemand]: 481/484 looper letters, 21 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2022-11-20 10:34:48,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 313 transitions, 922 flow [2022-11-20 10:34:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2022-11-20 10:34:48,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2022-11-20 10:34:48,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1266 transitions. [2022-11-20 10:34:48,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1266 transitions. [2022-11-20 10:34:48,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:48,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1266 transitions. [2022-11-20 10:34:48,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.0) internal successors, (1266), 3 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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 10:34:48,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:48,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:48,148 INFO L175 Difference]: Start difference. First operand has 286 places, 314 transitions, 878 flow. Second operand 3 states and 1266 transitions. [2022-11-20 10:34:48,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 313 transitions, 922 flow [2022-11-20 10:34:48,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 313 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:48,158 INFO L231 Difference]: Finished difference. Result has 285 places, 313 transitions, 850 flow [2022-11-20 10:34:48,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=285, PETRI_TRANSITIONS=313} [2022-11-20 10:34:48,159 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -25 predicate places. [2022-11-20 10:34:48,160 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 313 transitions, 850 flow [2022-11-20 10:34:48,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 10:34:48,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:48,161 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] [2022-11-20 10:34:48,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:34:48,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1524366374, now seen corresponding path program 1 times [2022-11-20 10:34:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:48,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881241159] [2022-11-20 10:34:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:48,276 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 10:34:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:48,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881241159] [2022-11-20 10:34:48,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881241159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:48,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:48,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794349103] [2022-11-20 10:34:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:48,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:48,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:48,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 484 [2022-11-20 10:34:48,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 313 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 10:34:48,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:48,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 484 [2022-11-20 10:34:48,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:48,884 INFO L130 PetriNetUnfolder]: 333/2445 cut-off events. [2022-11-20 10:34:48,884 INFO L131 PetriNetUnfolder]: For 666/791 co-relation queries the response was YES. [2022-11-20 10:34:48,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 2445 events. 333/2445 cut-off events. For 666/791 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 19189 event pairs, 61 based on Foata normal form. 2/2155 useless extension candidates. Maximal degree in co-relation 3604. Up to 409 conditions per place. [2022-11-20 10:34:48,910 INFO L137 encePairwiseOnDemand]: 478/484 looper letters, 68 selfloop transitions, 9 changer transitions 0/324 dead transitions. [2022-11-20 10:34:48,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 324 transitions, 1054 flow [2022-11-20 10:34:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2022-11-20 10:34:48,916 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8353994490358126 [2022-11-20 10:34:48,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1213 transitions. [2022-11-20 10:34:48,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1213 transitions. [2022-11-20 10:34:48,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:48,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1213 transitions. [2022-11-20 10:34:48,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 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 10:34:48,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:48,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:48,924 INFO L175 Difference]: Start difference. First operand has 285 places, 313 transitions, 850 flow. Second operand 3 states and 1213 transitions. [2022-11-20 10:34:48,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 324 transitions, 1054 flow [2022-11-20 10:34:48,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 324 transitions, 1050 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:48,935 INFO L231 Difference]: Finished difference. Result has 287 places, 318 transitions, 920 flow [2022-11-20 10:34:48,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=920, PETRI_PLACES=287, PETRI_TRANSITIONS=318} [2022-11-20 10:34:48,936 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -23 predicate places. [2022-11-20 10:34:48,936 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 318 transitions, 920 flow [2022-11-20 10:34:48,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.6666666666667) internal successors, (1172), 3 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 10:34:48,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:48,937 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] [2022-11-20 10:34:48,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:34:48,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 909100273, now seen corresponding path program 1 times [2022-11-20 10:34:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:48,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550601397] [2022-11-20 10:34:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:49,082 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 10:34:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550601397] [2022-11-20 10:34:49,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550601397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:49,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:49,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751031141] [2022-11-20 10:34:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:49,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:49,087 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 484 [2022-11-20 10:34:49,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 318 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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 10:34:49,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:49,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 484 [2022-11-20 10:34:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:50,068 INFO L130 PetriNetUnfolder]: 746/4652 cut-off events. [2022-11-20 10:34:50,069 INFO L131 PetriNetUnfolder]: For 2003/2306 co-relation queries the response was YES. [2022-11-20 10:34:50,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7255 conditions, 4652 events. 746/4652 cut-off events. For 2003/2306 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44371 event pairs, 231 based on Foata normal form. 7/4142 useless extension candidates. Maximal degree in co-relation 6525. Up to 832 conditions per place. [2022-11-20 10:34:50,122 INFO L137 encePairwiseOnDemand]: 478/484 looper letters, 73 selfloop transitions, 9 changer transitions 1/329 dead transitions. [2022-11-20 10:34:50,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 329 transitions, 1140 flow [2022-11-20 10:34:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:34:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1211 transitions. [2022-11-20 10:34:50,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8340220385674931 [2022-11-20 10:34:50,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1211 transitions. [2022-11-20 10:34:50,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1211 transitions. [2022-11-20 10:34:50,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:50,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1211 transitions. [2022-11-20 10:34:50,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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 10:34:50,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:50,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 484.0) internal successors, (1936), 4 states have internal predecessors, (1936), 0 states have call successors, (0), 0 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 10:34:50,134 INFO L175 Difference]: Start difference. First operand has 287 places, 318 transitions, 920 flow. Second operand 3 states and 1211 transitions. [2022-11-20 10:34:50,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 329 transitions, 1140 flow [2022-11-20 10:34:50,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 329 transitions, 1116 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:50,149 INFO L231 Difference]: Finished difference. Result has 289 places, 322 transitions, 972 flow [2022-11-20 10:34:50,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=289, PETRI_TRANSITIONS=322} [2022-11-20 10:34:50,152 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -21 predicate places. [2022-11-20 10:34:50,152 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 322 transitions, 972 flow [2022-11-20 10:34:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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 10:34:50,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:50,153 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] [2022-11-20 10:34:50,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:34:50,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2135320134, now seen corresponding path program 1 times [2022-11-20 10:34:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:50,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600916062] [2022-11-20 10:34:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:50,347 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 10:34:50,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600916062] [2022-11-20 10:34:50,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600916062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:50,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:50,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:34:50,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978770936] [2022-11-20 10:34:50,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:50,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:34:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:50,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:34:50,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:34:50,352 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 484 [2022-11-20 10:34:50,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 322 transitions, 972 flow. Second operand has 5 states, 5 states have (on average 441.2) internal successors, (2206), 5 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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 10:34:50,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:50,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 484 [2022-11-20 10:34:50,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:51,826 INFO L130 PetriNetUnfolder]: 732/5579 cut-off events. [2022-11-20 10:34:51,826 INFO L131 PetriNetUnfolder]: For 2477/2589 co-relation queries the response was YES. [2022-11-20 10:34:51,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8518 conditions, 5579 events. 732/5579 cut-off events. For 2477/2589 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 50055 event pairs, 60 based on Foata normal form. 9/4931 useless extension candidates. Maximal degree in co-relation 8429. Up to 396 conditions per place. [2022-11-20 10:34:51,892 INFO L137 encePairwiseOnDemand]: 476/484 looper letters, 23 selfloop transitions, 8 changer transitions 0/337 dead transitions. [2022-11-20 10:34:51,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 337 transitions, 1078 flow [2022-11-20 10:34:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:34:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:34:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3105 transitions. [2022-11-20 10:34:51,900 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.916469893742621 [2022-11-20 10:34:51,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3105 transitions. [2022-11-20 10:34:51,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3105 transitions. [2022-11-20 10:34:51,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:51,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3105 transitions. [2022-11-20 10:34:51,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 443.57142857142856) internal successors, (3105), 7 states have internal predecessors, (3105), 0 states have call successors, (0), 0 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 10:34:51,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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 10:34:51,921 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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 10:34:51,921 INFO L175 Difference]: Start difference. First operand has 289 places, 322 transitions, 972 flow. Second operand 7 states and 3105 transitions. [2022-11-20 10:34:51,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 337 transitions, 1078 flow [2022-11-20 10:34:51,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 337 transitions, 1048 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-20 10:34:51,940 INFO L231 Difference]: Finished difference. Result has 298 places, 329 transitions, 1000 flow [2022-11-20 10:34:51,941 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1000, PETRI_PLACES=298, PETRI_TRANSITIONS=329} [2022-11-20 10:34:51,942 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2022-11-20 10:34:51,943 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 329 transitions, 1000 flow [2022-11-20 10:34:51,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 441.2) internal successors, (2206), 5 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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 10:34:51,944 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:51,944 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] [2022-11-20 10:34:51,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:34:51,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 391326513, now seen corresponding path program 1 times [2022-11-20 10:34:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:51,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671761681] [2022-11-20 10:34:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:52,136 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 10:34:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:52,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671761681] [2022-11-20 10:34:52,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671761681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:52,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:52,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:34:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689094771] [2022-11-20 10:34:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:52,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:34:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:52,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:34:52,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:34:52,141 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 484 [2022-11-20 10:34:52,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 329 transitions, 1000 flow. Second operand has 5 states, 5 states have (on average 442.0) internal successors, (2210), 5 states have internal predecessors, (2210), 0 states have call successors, (0), 0 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 10:34:52,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:52,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 484 [2022-11-20 10:34:52,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:53,757 INFO L130 PetriNetUnfolder]: 832/6452 cut-off events. [2022-11-20 10:34:53,758 INFO L131 PetriNetUnfolder]: For 2590/2708 co-relation queries the response was YES. [2022-11-20 10:34:53,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9939 conditions, 6452 events. 832/6452 cut-off events. For 2590/2708 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 58760 event pairs, 77 based on Foata normal form. 11/5737 useless extension candidates. Maximal degree in co-relation 9846. Up to 486 conditions per place. [2022-11-20 10:34:53,869 INFO L137 encePairwiseOnDemand]: 477/484 looper letters, 26 selfloop transitions, 9 changer transitions 0/349 dead transitions. [2022-11-20 10:34:53,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 349 transitions, 1121 flow [2022-11-20 10:34:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:34:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:34:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3116 transitions. [2022-11-20 10:34:53,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9197166469893743 [2022-11-20 10:34:53,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3116 transitions. [2022-11-20 10:34:53,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3116 transitions. [2022-11-20 10:34:53,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:53,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3116 transitions. [2022-11-20 10:34:53,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 445.14285714285717) internal successors, (3116), 7 states have internal predecessors, (3116), 0 states have call successors, (0), 0 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 10:34:53,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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 10:34:53,898 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 484.0) internal successors, (3872), 8 states have internal predecessors, (3872), 0 states have call successors, (0), 0 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 10:34:53,898 INFO L175 Difference]: Start difference. First operand has 298 places, 329 transitions, 1000 flow. Second operand 7 states and 3116 transitions. [2022-11-20 10:34:53,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 349 transitions, 1121 flow [2022-11-20 10:34:53,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 349 transitions, 1121 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:34:53,913 INFO L231 Difference]: Finished difference. Result has 310 places, 337 transitions, 1068 flow [2022-11-20 10:34:53,914 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=484, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1068, PETRI_PLACES=310, PETRI_TRANSITIONS=337} [2022-11-20 10:34:53,917 INFO L288 CegarLoopForPetriNet]: 310 programPoint places, 0 predicate places. [2022-11-20 10:34:53,917 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 337 transitions, 1068 flow [2022-11-20 10:34:53,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 442.0) internal successors, (2210), 5 states have internal predecessors, (2210), 0 states have call successors, (0), 0 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 10:34:53,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:53,919 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] [2022-11-20 10:34:53,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:34:53,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-20 10:34:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash -736200102, now seen corresponding path program 1 times [2022-11-20 10:34:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:53,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135348255] [2022-11-20 10:34:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:34:53,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:34:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:34:54,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:34:54,098 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:34:54,099 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (39 of 40 remaining) [2022-11-20 10:34:54,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2022-11-20 10:34:54,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2022-11-20 10:34:54,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2022-11-20 10:34:54,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2022-11-20 10:34:54,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2022-11-20 10:34:54,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2022-11-20 10:34:54,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2022-11-20 10:34:54,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2022-11-20 10:34:54,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2022-11-20 10:34:54,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 40 remaining) [2022-11-20 10:34:54,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2022-11-20 10:34:54,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2022-11-20 10:34:54,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2022-11-20 10:34:54,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2022-11-20 10:34:54,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2022-11-20 10:34:54,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2022-11-20 10:34:54,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2022-11-20 10:34:54,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2022-11-20 10:34:54,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2022-11-20 10:34:54,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2022-11-20 10:34:54,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2022-11-20 10:34:54,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2022-11-20 10:34:54,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2022-11-20 10:34:54,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 40 remaining) [2022-11-20 10:34:54,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2022-11-20 10:34:54,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2022-11-20 10:34:54,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2022-11-20 10:34:54,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2022-11-20 10:34:54,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2022-11-20 10:34:54,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2022-11-20 10:34:54,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2022-11-20 10:34:54,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2022-11-20 10:34:54,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2022-11-20 10:34:54,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2022-11-20 10:34:54,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2022-11-20 10:34:54,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2022-11-20 10:34:54,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2022-11-20 10:34:54,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2022-11-20 10:34:54,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 40 remaining) [2022-11-20 10:34:54,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:34:54,116 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:54,128 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:34:54,128 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:34:54,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:34:54 BasicIcfg [2022-11-20 10:34:54,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:34:54,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:34:54,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:34:54,291 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:34:54,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:38" (3/4) ... [2022-11-20 10:34:54,296 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:34:54,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:34:54,297 INFO L158 Benchmark]: Toolchain (without parser) took 17766.85ms. Allocated memory was 184.5MB in the beginning and 476.1MB in the end (delta: 291.5MB). Free memory was 133.7MB in the beginning and 374.7MB in the end (delta: -241.0MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,297 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 184.5MB. Free memory was 154.7MB in the beginning and 154.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:34:54,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1197.35ms. Allocated memory is still 184.5MB. Free memory was 133.7MB in the beginning and 78.5MB in the end (delta: 55.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.52ms. Allocated memory is still 184.5MB. Free memory was 78.5MB in the beginning and 75.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,299 INFO L158 Benchmark]: Boogie Preprocessor took 125.01ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 75.0MB in the beginning and 197.1MB in the end (delta: -122.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,299 INFO L158 Benchmark]: RCFGBuilder took 1058.19ms. Allocated memory is still 230.7MB. Free memory was 197.1MB in the beginning and 166.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,300 INFO L158 Benchmark]: TraceAbstraction took 15298.43ms. Allocated memory was 230.7MB in the beginning and 476.1MB in the end (delta: 245.4MB). Free memory was 166.7MB in the beginning and 375.7MB in the end (delta: -209.0MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,300 INFO L158 Benchmark]: Witness Printer took 6.07ms. Allocated memory is still 476.1MB. Free memory was 375.7MB in the beginning and 374.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:34:54,304 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.30ms. Allocated memory is still 184.5MB. Free memory was 154.7MB in the beginning and 154.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1197.35ms. Allocated memory is still 184.5MB. Free memory was 133.7MB in the beginning and 78.5MB in the end (delta: 55.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.52ms. Allocated memory is still 184.5MB. Free memory was 78.5MB in the beginning and 75.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.01ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 75.0MB in the beginning and 197.1MB in the end (delta: -122.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1058.19ms. Allocated memory is still 230.7MB. Free memory was 197.1MB in the beginning and 166.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15298.43ms. Allocated memory was 230.7MB in the beginning and 476.1MB in the end (delta: 245.4MB). Free memory was 166.7MB in the beginning and 375.7MB in the end (delta: -209.0MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 6.07ms. Allocated memory is still 476.1MB. Free memory was 375.7MB in the beginning and 374.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1, t2; VAL [t1={3:0}, t2={4:0}] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={5:0}, t1={3:0}, t2={4:0}] [L1696] 0 int pdev; VAL [mutex={5:0}, pdev=0, t1={3:0}, t2={4:0}] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={5:0}, pdev=0, t1={3:0}, t2={4:0}] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1780] EXPR 0 pdev==1 VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, pthread_create(&t1, ((void *)0), thread_usb, ((void *)0))=-1, t1={3:0}, t2={4:0}] [L1743] 1 ldv_usb_state = 0 VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1744] 1 int probe_ret; VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1745] COND TRUE 1 1 VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1747] 1 case 0: VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1748] 1 ldv_usb_state==0 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1748] COND TRUE 1 ldv_usb_state==0 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={5:0}, pdev=1, pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0))=0, t1={3:0}, t2={4:0}] [L1704] COND TRUE 2 1 VAL [arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1706] 2 case 1: VAL [__VERIFIER_nondet_int()=1, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=1, t1={3:0}, t2={4:0}] [L1707] CALL 2 ath9k_flush() [L1699] 2 pdev = 6 VAL [ldv_usb_state=0, mutex={5:0}, pdev=6, pdev = 6=1151, t1={3:0}, t2={4:0}] [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ieee80211_register_hw()=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={5:0}, pdev=6, t1={3:0}, t2={4:0}] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ath_ahb_probe()=0, ldv_usb_state=0, mutex={5:0}, pdev=6, probe_ret=0, t1={3:0}, t2={4:0}] [L1750] COND FALSE 1 !(probe_ret!=0) VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=0, mutex={5:0}, pdev=6, probe_ret=0, t1={3:0}, t2={4:0}] [L1752] 1 ldv_usb_state = 1 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=1, mutex={5:0}, pdev=6, probe_ret=0, t1={3:0}, t2={4:0}] [L1753] 1 pdev = 7 VAL [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, ldv_usb_state=1, mutex={5:0}, pdev=7, pdev = 7=1150, probe_ret=0, t1={3:0}, t2={4:0}] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={5:0}, pdev=7, pdev = 6=1151, t1={3:0}, t2={4:0}] Now there is a data race on ~pdev~0 between C: pdev = 7 [1753] and C: pdev = 6 [1699] - UnprovableResult [Line: 1700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1779]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1795]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 491 locations, 40 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 360 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=14, InterpolantAutomatonStates: 53, 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, 2.3s InterpolantComputationTime, 1192 NumberOfCodeBlocks, 1192 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1062 ConstructedInterpolants, 0 QuantifiedInterpolants, 1215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:34:54,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb3680f1-a8eb-4a2c-a48a-b5122f359c63/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE