./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:44:11,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:44:12,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:44:12,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:44:12,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:44:12,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:44:12,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:44:12,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:44:12,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:44:12,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:44:12,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:44:12,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:44:12,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:44:12,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:44:12,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:44:12,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:44:12,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:44:12,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:44:12,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:44:12,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:44:12,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:44:12,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:44:12,123 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:44:12,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:44:12,124 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:44:12,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:44:12,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:44:12,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:44:12,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:44:12,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:44:12,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:44:12,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:44:12,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:44:12,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:44:12,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:44:12,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:44:12,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:44:12,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:44:12,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:44:12,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:44:12,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:44:12,129 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a9552a698db9701543deeff63aa990ab8fc4764b65dba5035623425bdf77554d [2024-11-19 05:44:12,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:44:12,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:44:12,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:44:12,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:44:12,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:44:12,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-11-19 05:44:13,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:44:14,298 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:44:14,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_1-thread_local_vars.i [2024-11-19 05:44:14,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e4627d3/8cbd4958a70b4edd8f78b8df7b56aa22/FLAG0bb3a5002 [2024-11-19 05:44:14,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e4627d3/8cbd4958a70b4edd8f78b8df7b56aa22 [2024-11-19 05:44:14,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:44:14,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:44:14,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:44:14,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:44:14,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:44:14,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:44:14" (1/1) ... [2024-11-19 05:44:14,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e8cce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:14, skipping insertion in model container [2024-11-19 05:44:14,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:44:14" (1/1) ... [2024-11-19 05:44:14,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:44:15,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:44:15,153 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:44:15,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:44:15,458 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:44:15,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15 WrapperNode [2024-11-19 05:44:15,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:44:15,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:44:15,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:44:15,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:44:15,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,535 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 280 [2024-11-19 05:44:15,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:44:15,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:44:15,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:44:15,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:44:15,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:44:15,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:44:15,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:44:15,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:44:15,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (1/1) ... [2024-11-19 05:44:15,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:44:15,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:44:15,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:44:15,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:44:15,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-11-19 05:44:15,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-11-19 05:44:15,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:44:15,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-11-19 05:44:15,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:44:15,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:44:15,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:44:15,676 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:44:15,958 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:44:15,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:44:16,321 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:44:16,321 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:44:16,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:44:16,360 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 05:44:16,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:44:16 BoogieIcfgContainer [2024-11-19 05:44:16,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:44:16,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:44:16,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:44:16,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:44:16,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:44:14" (1/3) ... [2024-11-19 05:44:16,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec01caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:44:16, skipping insertion in model container [2024-11-19 05:44:16,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:44:15" (2/3) ... [2024-11-19 05:44:16,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec01caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:44:16, skipping insertion in model container [2024-11-19 05:44:16,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:44:16" (3/3) ... [2024-11-19 05:44:16,371 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-11-19 05:44:16,408 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:44:16,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-19 05:44:16,408 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:44:16,543 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-19 05:44:16,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 470 transitions, 967 flow [2024-11-19 05:44:16,757 INFO L124 PetriNetUnfolderBase]: 41/476 cut-off events. [2024-11-19 05:44:16,757 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:44:16,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 476 events. 41/476 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1280 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 323. Up to 11 conditions per place. [2024-11-19 05:44:16,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 432 places, 470 transitions, 967 flow [2024-11-19 05:44:16,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 326 transitions, 668 flow [2024-11-19 05:44:16,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:44:16,801 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a84715a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:44:16,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-19 05:44:16,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:44:16,808 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:44:16,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:44:16,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:16,809 INFO L204 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] [2024-11-19 05:44:16,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:16,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1208568071, now seen corresponding path program 1 times [2024-11-19 05:44:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781049489] [2024-11-19 05:44:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:17,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781049489] [2024-11-19 05:44:17,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781049489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:17,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:17,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434116231] [2024-11-19 05:44:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:17,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:17,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:17,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:17,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-19 05:44:17,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 326 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:17,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:17,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-19 05:44:17,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:17,588 INFO L124 PetriNetUnfolderBase]: 82/946 cut-off events. [2024-11-19 05:44:17,588 INFO L125 PetriNetUnfolderBase]: For 27/35 co-relation queries the response was YES. [2024-11-19 05:44:17,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 946 events. 82/946 cut-off events. For 27/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4774 event pairs, 48 based on Foata normal form. 73/883 useless extension candidates. Maximal degree in co-relation 765. Up to 125 conditions per place. [2024-11-19 05:44:17,601 INFO L140 encePairwiseOnDemand]: 451/470 looper letters, 22 selfloop transitions, 2 changer transitions 6/297 dead transitions. [2024-11-19 05:44:17,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 297 transitions, 658 flow [2024-11-19 05:44:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2024-11-19 05:44:17,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-19 05:44:17,627 INFO L175 Difference]: Start difference. First operand has 303 places, 326 transitions, 668 flow. Second operand 3 states and 1265 transitions. [2024-11-19 05:44:17,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 297 transitions, 658 flow [2024-11-19 05:44:17,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 297 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:17,642 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 598 flow [2024-11-19 05:44:17,645 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2024-11-19 05:44:17,649 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -13 predicate places. [2024-11-19 05:44:17,650 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 598 flow [2024-11-19 05:44:17,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:17,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:17,652 INFO L204 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] [2024-11-19 05:44:17,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:44:17,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:17,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -258701395, now seen corresponding path program 1 times [2024-11-19 05:44:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738279483] [2024-11-19 05:44:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738279483] [2024-11-19 05:44:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738279483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990631974] [2024-11-19 05:44:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:17,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 470 [2024-11-19 05:44:17,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:17,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:17,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 470 [2024-11-19 05:44:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:18,049 INFO L124 PetriNetUnfolderBase]: 83/951 cut-off events. [2024-11-19 05:44:18,050 INFO L125 PetriNetUnfolderBase]: For 14/19 co-relation queries the response was YES. [2024-11-19 05:44:18,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 951 events. 83/951 cut-off events. For 14/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4777 event pairs, 21 based on Foata normal form. 1/838 useless extension candidates. Maximal degree in co-relation 1081. Up to 112 conditions per place. [2024-11-19 05:44:18,060 INFO L140 encePairwiseOnDemand]: 450/470 looper letters, 26 selfloop transitions, 14 changer transitions 0/300 dead transitions. [2024-11-19 05:44:18,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 697 flow [2024-11-19 05:44:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1240 transitions. [2024-11-19 05:44:18,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-19 05:44:18,065 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 598 flow. Second operand 3 states and 1240 transitions. [2024-11-19 05:44:18,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 697 flow [2024-11-19 05:44:18,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:18,075 INFO L231 Difference]: Finished difference. Result has 283 places, 297 transitions, 686 flow [2024-11-19 05:44:18,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=283, PETRI_TRANSITIONS=297} [2024-11-19 05:44:18,076 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -20 predicate places. [2024-11-19 05:44:18,078 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 297 transitions, 686 flow [2024-11-19 05:44:18,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:18,080 INFO L204 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] [2024-11-19 05:44:18,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:44:18,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1194276038, now seen corresponding path program 1 times [2024-11-19 05:44:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987920693] [2024-11-19 05:44:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987920693] [2024-11-19 05:44:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987920693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:18,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293589827] [2024-11-19 05:44:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:18,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:18,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-19 05:44:18,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 297 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:18,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-19 05:44:18,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:18,488 INFO L124 PetriNetUnfolderBase]: 137/1399 cut-off events. [2024-11-19 05:44:18,488 INFO L125 PetriNetUnfolderBase]: For 273/311 co-relation queries the response was YES. [2024-11-19 05:44:18,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1399 events. 137/1399 cut-off events. For 273/311 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8704 event pairs, 61 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1443. Up to 203 conditions per place. [2024-11-19 05:44:18,504 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 28 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-11-19 05:44:18,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 296 transitions, 744 flow [2024-11-19 05:44:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2024-11-19 05:44:18,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8858156028368794 [2024-11-19 05:44:18,510 INFO L175 Difference]: Start difference. First operand has 283 places, 297 transitions, 686 flow. Second operand 3 states and 1249 transitions. [2024-11-19 05:44:18,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 296 transitions, 744 flow [2024-11-19 05:44:18,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 296 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:18,519 INFO L231 Difference]: Finished difference. Result has 282 places, 296 transitions, 660 flow [2024-11-19 05:44:18,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=282, PETRI_TRANSITIONS=296} [2024-11-19 05:44:18,521 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -21 predicate places. [2024-11-19 05:44:18,522 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 296 transitions, 660 flow [2024-11-19 05:44:18,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:18,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:18,523 INFO L204 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] [2024-11-19 05:44:18,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:44:18,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1090006123, now seen corresponding path program 1 times [2024-11-19 05:44:18,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:18,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696966289] [2024-11-19 05:44:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696966289] [2024-11-19 05:44:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696966289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:18,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:18,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392541235] [2024-11-19 05:44:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:18,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:18,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:18,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 470 [2024-11-19 05:44:18,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 296 transitions, 660 flow. Second operand has 3 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) [2024-11-19 05:44:18,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:18,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 470 [2024-11-19 05:44:18,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:18,802 INFO L124 PetriNetUnfolderBase]: 99/1140 cut-off events. [2024-11-19 05:44:18,803 INFO L125 PetriNetUnfolderBase]: For 24/55 co-relation queries the response was YES. [2024-11-19 05:44:18,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1140 events. 99/1140 cut-off events. For 24/55 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6770 event pairs, 9 based on Foata normal form. 4/991 useless extension candidates. Maximal degree in co-relation 1332. Up to 98 conditions per place. [2024-11-19 05:44:18,813 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 17 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-19 05:44:18,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 300 transitions, 715 flow [2024-11-19 05:44:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-19 05:44:18,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9120567375886525 [2024-11-19 05:44:18,817 INFO L175 Difference]: Start difference. First operand has 282 places, 296 transitions, 660 flow. Second operand 3 states and 1286 transitions. [2024-11-19 05:44:18,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 300 transitions, 715 flow [2024-11-19 05:44:18,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 300 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:18,825 INFO L231 Difference]: Finished difference. Result has 281 places, 295 transitions, 658 flow [2024-11-19 05:44:18,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=281, PETRI_TRANSITIONS=295} [2024-11-19 05:44:18,827 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -22 predicate places. [2024-11-19 05:44:18,828 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 295 transitions, 658 flow [2024-11-19 05:44:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2024-11-19 05:44:18,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:18,829 INFO L204 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] [2024-11-19 05:44:18,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:44:18,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1642742462, now seen corresponding path program 1 times [2024-11-19 05:44:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478215199] [2024-11-19 05:44:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478215199] [2024-11-19 05:44:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478215199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:18,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803426634] [2024-11-19 05:44:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:18,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:18,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:18,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-11-19 05:44:18,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 295 transitions, 658 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) [2024-11-19 05:44:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-11-19 05:44:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:19,090 INFO L124 PetriNetUnfolderBase]: 78/1012 cut-off events. [2024-11-19 05:44:19,090 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:44:19,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1012 events. 78/1012 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5500 event pairs, 19 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1100. Up to 67 conditions per place. [2024-11-19 05:44:19,099 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 14 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-11-19 05:44:19,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 294 transitions, 688 flow [2024-11-19 05:44:19,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 05:44:19,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8950354609929078 [2024-11-19 05:44:19,102 INFO L175 Difference]: Start difference. First operand has 281 places, 295 transitions, 658 flow. Second operand 3 states and 1262 transitions. [2024-11-19 05:44:19,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 294 transitions, 688 flow [2024-11-19 05:44:19,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 294 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:19,107 INFO L231 Difference]: Finished difference. Result has 280 places, 294 transitions, 656 flow [2024-11-19 05:44:19,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=280, PETRI_TRANSITIONS=294} [2024-11-19 05:44:19,109 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -23 predicate places. [2024-11-19 05:44:19,109 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 294 transitions, 656 flow [2024-11-19 05:44:19,111 INFO L472 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) [2024-11-19 05:44:19,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:19,111 INFO L204 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] [2024-11-19 05:44:19,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:44:19,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:19,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash 281040216, now seen corresponding path program 1 times [2024-11-19 05:44:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:19,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61799667] [2024-11-19 05:44:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61799667] [2024-11-19 05:44:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61799667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:19,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:19,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664428210] [2024-11-19 05:44:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:19,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 470 [2024-11-19 05:44:19,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 294 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:19,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 470 [2024-11-19 05:44:19,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:19,396 INFO L124 PetriNetUnfolderBase]: 85/924 cut-off events. [2024-11-19 05:44:19,397 INFO L125 PetriNetUnfolderBase]: For 17/39 co-relation queries the response was YES. [2024-11-19 05:44:19,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 924 events. 85/924 cut-off events. For 17/39 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4927 event pairs, 9 based on Foata normal form. 4/819 useless extension candidates. Maximal degree in co-relation 1024. Up to 69 conditions per place. [2024-11-19 05:44:19,404 INFO L140 encePairwiseOnDemand]: 468/470 looper letters, 14 selfloop transitions, 1 changer transitions 19/298 dead transitions. [2024-11-19 05:44:19,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 298 transitions, 703 flow [2024-11-19 05:44:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2024-11-19 05:44:19,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2024-11-19 05:44:19,408 INFO L175 Difference]: Start difference. First operand has 280 places, 294 transitions, 656 flow. Second operand 3 states and 1294 transitions. [2024-11-19 05:44:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 298 transitions, 703 flow [2024-11-19 05:44:19,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:19,414 INFO L231 Difference]: Finished difference. Result has 279 places, 274 transitions, 610 flow [2024-11-19 05:44:19,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=279, PETRI_TRANSITIONS=274} [2024-11-19 05:44:19,415 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -24 predicate places. [2024-11-19 05:44:19,416 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 274 transitions, 610 flow [2024-11-19 05:44:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:19,417 INFO L204 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] [2024-11-19 05:44:19,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:44:19,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:19,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash 602710765, now seen corresponding path program 1 times [2024-11-19 05:44:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:19,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643830446] [2024-11-19 05:44:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643830446] [2024-11-19 05:44:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643830446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268212054] [2024-11-19 05:44:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:19,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:19,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 470 [2024-11-19 05:44:19,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 274 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:19,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 470 [2024-11-19 05:44:19,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:19,695 INFO L124 PetriNetUnfolderBase]: 101/1142 cut-off events. [2024-11-19 05:44:19,695 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:44:19,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 1142 events. 101/1142 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6642 event pairs, 23 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1281. Up to 83 conditions per place. [2024-11-19 05:44:19,701 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 16 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2024-11-19 05:44:19,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 276 transitions, 656 flow [2024-11-19 05:44:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2024-11-19 05:44:19,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-19 05:44:19,705 INFO L175 Difference]: Start difference. First operand has 279 places, 274 transitions, 610 flow. Second operand 3 states and 1245 transitions. [2024-11-19 05:44:19,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 276 transitions, 656 flow [2024-11-19 05:44:19,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 276 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:44:19,710 INFO L231 Difference]: Finished difference. Result has 260 places, 274 transitions, 630 flow [2024-11-19 05:44:19,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=260, PETRI_TRANSITIONS=274} [2024-11-19 05:44:19,712 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -43 predicate places. [2024-11-19 05:44:19,712 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 274 transitions, 630 flow [2024-11-19 05:44:19,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:19,714 INFO L204 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] [2024-11-19 05:44:19,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:44:19,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:19,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash -779475163, now seen corresponding path program 1 times [2024-11-19 05:44:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064670815] [2024-11-19 05:44:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064670815] [2024-11-19 05:44:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064670815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:19,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:44:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004635687] [2024-11-19 05:44:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:19,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:19,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 470 [2024-11-19 05:44:19,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 274 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:19,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:19,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 470 [2024-11-19 05:44:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,031 INFO L124 PetriNetUnfolderBase]: 103/1074 cut-off events. [2024-11-19 05:44:20,032 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 05:44:20,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1074 events. 103/1074 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5939 event pairs, 14 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 1229. Up to 63 conditions per place. [2024-11-19 05:44:20,041 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 15 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2024-11-19 05:44:20,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 278 transitions, 678 flow [2024-11-19 05:44:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2024-11-19 05:44:20,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-19 05:44:20,045 INFO L175 Difference]: Start difference. First operand has 260 places, 274 transitions, 630 flow. Second operand 3 states and 1265 transitions. [2024-11-19 05:44:20,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 278 transitions, 678 flow [2024-11-19 05:44:20,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 278 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:44:20,051 INFO L231 Difference]: Finished difference. Result has 263 places, 276 transitions, 659 flow [2024-11-19 05:44:20,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=263, PETRI_TRANSITIONS=276} [2024-11-19 05:44:20,053 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -40 predicate places. [2024-11-19 05:44:20,054 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 276 transitions, 659 flow [2024-11-19 05:44:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,055 INFO L204 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] [2024-11-19 05:44:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:44:20,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash -180834619, now seen corresponding path program 1 times [2024-11-19 05:44:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199667743] [2024-11-19 05:44:20,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199667743] [2024-11-19 05:44:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199667743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315952740] [2024-11-19 05:44:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:20,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 470 [2024-11-19 05:44:20,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 276 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:20,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 470 [2024-11-19 05:44:20,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,383 INFO L124 PetriNetUnfolderBase]: 120/1104 cut-off events. [2024-11-19 05:44:20,383 INFO L125 PetriNetUnfolderBase]: For 87/100 co-relation queries the response was YES. [2024-11-19 05:44:20,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1104 events. 120/1104 cut-off events. For 87/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5988 event pairs, 28 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 1370. Up to 137 conditions per place. [2024-11-19 05:44:20,399 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 26 selfloop transitions, 8 changer transitions 0/284 dead transitions. [2024-11-19 05:44:20,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 284 transitions, 753 flow [2024-11-19 05:44:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-11-19 05:44:20,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2024-11-19 05:44:20,403 INFO L175 Difference]: Start difference. First operand has 263 places, 276 transitions, 659 flow. Second operand 3 states and 1260 transitions. [2024-11-19 05:44:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 284 transitions, 753 flow [2024-11-19 05:44:20,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 284 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:20,408 INFO L231 Difference]: Finished difference. Result has 265 places, 282 transitions, 717 flow [2024-11-19 05:44:20,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=265, PETRI_TRANSITIONS=282} [2024-11-19 05:44:20,409 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -38 predicate places. [2024-11-19 05:44:20,410 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 282 transitions, 717 flow [2024-11-19 05:44:20,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,411 INFO L204 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] [2024-11-19 05:44:20,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:44:20,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash 59076434, now seen corresponding path program 1 times [2024-11-19 05:44:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926179864] [2024-11-19 05:44:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926179864] [2024-11-19 05:44:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926179864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401806521] [2024-11-19 05:44:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:20,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 470 [2024-11-19 05:44:20,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 282 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:20,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 470 [2024-11-19 05:44:20,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,656 INFO L124 PetriNetUnfolderBase]: 114/1189 cut-off events. [2024-11-19 05:44:20,656 INFO L125 PetriNetUnfolderBase]: For 83/94 co-relation queries the response was YES. [2024-11-19 05:44:20,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1189 events. 114/1189 cut-off events. For 83/94 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6837 event pairs, 14 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1459. Up to 73 conditions per place. [2024-11-19 05:44:20,667 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 14 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-19 05:44:20,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 283 transitions, 751 flow [2024-11-19 05:44:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2024-11-19 05:44:20,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056737588652483 [2024-11-19 05:44:20,671 INFO L175 Difference]: Start difference. First operand has 265 places, 282 transitions, 717 flow. Second operand 3 states and 1277 transitions. [2024-11-19 05:44:20,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 283 transitions, 751 flow [2024-11-19 05:44:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 283 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:20,677 INFO L231 Difference]: Finished difference. Result has 264 places, 281 transitions, 703 flow [2024-11-19 05:44:20,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=264, PETRI_TRANSITIONS=281} [2024-11-19 05:44:20,678 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -39 predicate places. [2024-11-19 05:44:20,679 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 281 transitions, 703 flow [2024-11-19 05:44:20,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,680 INFO L204 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] [2024-11-19 05:44:20,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:44:20,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr3ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:20,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1232941445, now seen corresponding path program 1 times [2024-11-19 05:44:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652429102] [2024-11-19 05:44:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652429102] [2024-11-19 05:44:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652429102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:20,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673345312] [2024-11-19 05:44:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:20,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:20,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-11-19 05:44:20,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 281 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:20,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-11-19 05:44:20,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:20,971 INFO L124 PetriNetUnfolderBase]: 136/1235 cut-off events. [2024-11-19 05:44:20,972 INFO L125 PetriNetUnfolderBase]: For 93/112 co-relation queries the response was YES. [2024-11-19 05:44:20,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 1235 events. 136/1235 cut-off events. For 93/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7309 event pairs, 22 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 1537. Up to 92 conditions per place. [2024-11-19 05:44:20,983 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 19 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-19 05:44:20,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 282 transitions, 747 flow [2024-11-19 05:44:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-11-19 05:44:20,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2024-11-19 05:44:20,987 INFO L175 Difference]: Start difference. First operand has 264 places, 281 transitions, 703 flow. Second operand 3 states and 1264 transitions. [2024-11-19 05:44:20,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 282 transitions, 747 flow [2024-11-19 05:44:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 282 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:20,993 INFO L231 Difference]: Finished difference. Result has 263 places, 280 transitions, 701 flow [2024-11-19 05:44:20,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=263, PETRI_TRANSITIONS=280} [2024-11-19 05:44:20,994 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -40 predicate places. [2024-11-19 05:44:20,994 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 280 transitions, 701 flow [2024-11-19 05:44:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:20,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:20,996 INFO L204 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] [2024-11-19 05:44:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:44:20,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash 756046649, now seen corresponding path program 1 times [2024-11-19 05:44:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144950747] [2024-11-19 05:44:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144950747] [2024-11-19 05:44:21,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144950747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:21,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:21,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745470137] [2024-11-19 05:44:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-19 05:44:21,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 280 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-19 05:44:21,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:21,303 INFO L124 PetriNetUnfolderBase]: 168/1252 cut-off events. [2024-11-19 05:44:21,304 INFO L125 PetriNetUnfolderBase]: For 266/343 co-relation queries the response was YES. [2024-11-19 05:44:21,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1252 events. 168/1252 cut-off events. For 266/343 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7371 event pairs, 39 based on Foata normal form. 8/1127 useless extension candidates. Maximal degree in co-relation 1773. Up to 236 conditions per place. [2024-11-19 05:44:21,313 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 31 selfloop transitions, 12 changer transitions 0/289 dead transitions. [2024-11-19 05:44:21,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 289 transitions, 824 flow [2024-11-19 05:44:21,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2024-11-19 05:44:21,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2024-11-19 05:44:21,317 INFO L175 Difference]: Start difference. First operand has 263 places, 280 transitions, 701 flow. Second operand 3 states and 1255 transitions. [2024-11-19 05:44:21,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 289 transitions, 824 flow [2024-11-19 05:44:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 289 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:21,324 INFO L231 Difference]: Finished difference. Result has 265 places, 288 transitions, 797 flow [2024-11-19 05:44:21,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=265, PETRI_TRANSITIONS=288} [2024-11-19 05:44:21,325 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -38 predicate places. [2024-11-19 05:44:21,325 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 288 transitions, 797 flow [2024-11-19 05:44:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:21,327 INFO L204 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] [2024-11-19 05:44:21,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:44:21,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash 904070119, now seen corresponding path program 1 times [2024-11-19 05:44:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:21,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32736727] [2024-11-19 05:44:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:21,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32736727] [2024-11-19 05:44:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32736727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:21,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322494167] [2024-11-19 05:44:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:21,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 470 [2024-11-19 05:44:21,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 288 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 470 [2024-11-19 05:44:21,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:21,693 INFO L124 PetriNetUnfolderBase]: 278/1846 cut-off events. [2024-11-19 05:44:21,693 INFO L125 PetriNetUnfolderBase]: For 952/1053 co-relation queries the response was YES. [2024-11-19 05:44:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1846 events. 278/1846 cut-off events. For 952/1053 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12908 event pairs, 86 based on Foata normal form. 8/1673 useless extension candidates. Maximal degree in co-relation 2614. Up to 358 conditions per place. [2024-11-19 05:44:21,709 INFO L140 encePairwiseOnDemand]: 464/470 looper letters, 38 selfloop transitions, 9 changer transitions 1/295 dead transitions. [2024-11-19 05:44:21,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 295 transitions, 925 flow [2024-11-19 05:44:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2024-11-19 05:44:21,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8893617021276595 [2024-11-19 05:44:21,713 INFO L175 Difference]: Start difference. First operand has 265 places, 288 transitions, 797 flow. Second operand 3 states and 1254 transitions. [2024-11-19 05:44:21,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 295 transitions, 925 flow [2024-11-19 05:44:21,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 295 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:21,721 INFO L231 Difference]: Finished difference. Result has 267 places, 292 transitions, 843 flow [2024-11-19 05:44:21,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=267, PETRI_TRANSITIONS=292} [2024-11-19 05:44:21,722 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -36 predicate places. [2024-11-19 05:44:21,723 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 292 transitions, 843 flow [2024-11-19 05:44:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:21,724 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:21,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:44:21,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_usbErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash -883329259, now seen corresponding path program 1 times [2024-11-19 05:44:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:21,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027297739] [2024-11-19 05:44:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:21,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:44:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027297739] [2024-11-19 05:44:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027297739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717032022] [2024-11-19 05:44:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:21,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:21,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 470 [2024-11-19 05:44:21,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 292 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:21,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:21,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 470 [2024-11-19 05:44:21,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:21,982 INFO L124 PetriNetUnfolderBase]: 152/1466 cut-off events. [2024-11-19 05:44:21,983 INFO L125 PetriNetUnfolderBase]: For 403/445 co-relation queries the response was YES. [2024-11-19 05:44:21,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 1466 events. 152/1466 cut-off events. For 403/445 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8367 event pairs, 16 based on Foata normal form. 2/1323 useless extension candidates. Maximal degree in co-relation 2023. Up to 104 conditions per place. [2024-11-19 05:44:21,998 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 11 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2024-11-19 05:44:21,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 296 transitions, 882 flow [2024-11-19 05:44:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2024-11-19 05:44:22,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9092198581560283 [2024-11-19 05:44:22,002 INFO L175 Difference]: Start difference. First operand has 267 places, 292 transitions, 843 flow. Second operand 3 states and 1282 transitions. [2024-11-19 05:44:22,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 296 transitions, 882 flow [2024-11-19 05:44:22,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 296 transitions, 858 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:22,009 INFO L231 Difference]: Finished difference. Result has 267 places, 292 transitions, 827 flow [2024-11-19 05:44:22,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=267, PETRI_TRANSITIONS=292} [2024-11-19 05:44:22,011 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -36 predicate places. [2024-11-19 05:44:22,011 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 292 transitions, 827 flow [2024-11-19 05:44:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:22,012 INFO L204 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] [2024-11-19 05:44:22,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:44:22,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -12439881, now seen corresponding path program 1 times [2024-11-19 05:44:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801797808] [2024-11-19 05:44:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:22,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801797808] [2024-11-19 05:44:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801797808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:44:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920557287] [2024-11-19 05:44:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:44:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:44:22,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:44:22,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 470 [2024-11-19 05:44:22,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 292 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 421.4) internal successors, (2107), 5 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:22,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 470 [2024-11-19 05:44:22,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:22,593 INFO L124 PetriNetUnfolderBase]: 342/2848 cut-off events. [2024-11-19 05:44:22,594 INFO L125 PetriNetUnfolderBase]: For 575/629 co-relation queries the response was YES. [2024-11-19 05:44:22,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 2848 events. 342/2848 cut-off events. For 575/629 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20705 event pairs, 32 based on Foata normal form. 4/2571 useless extension candidates. Maximal degree in co-relation 4024. Up to 205 conditions per place. [2024-11-19 05:44:22,619 INFO L140 encePairwiseOnDemand]: 462/470 looper letters, 32 selfloop transitions, 8 changer transitions 0/314 dead transitions. [2024-11-19 05:44:22,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 314 transitions, 958 flow [2024-11-19 05:44:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:44:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 05:44:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2974 transitions. [2024-11-19 05:44:22,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.903951367781155 [2024-11-19 05:44:22,627 INFO L175 Difference]: Start difference. First operand has 267 places, 292 transitions, 827 flow. Second operand 7 states and 2974 transitions. [2024-11-19 05:44:22,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 314 transitions, 958 flow [2024-11-19 05:44:22,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 314 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:44:22,635 INFO L231 Difference]: Finished difference. Result has 277 places, 299 transitions, 883 flow [2024-11-19 05:44:22,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=883, PETRI_PLACES=277, PETRI_TRANSITIONS=299} [2024-11-19 05:44:22,638 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -26 predicate places. [2024-11-19 05:44:22,638 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 299 transitions, 883 flow [2024-11-19 05:44:22,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 421.4) internal successors, (2107), 5 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:22,640 INFO L204 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] [2024-11-19 05:44:22,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:44:22,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -997250345, now seen corresponding path program 1 times [2024-11-19 05:44:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993765118] [2024-11-19 05:44:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993765118] [2024-11-19 05:44:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993765118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:22,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:44:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8913686] [2024-11-19 05:44:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:22,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:44:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:44:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:44:22,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 470 [2024-11-19 05:44:22,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 299 transitions, 883 flow. Second operand has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:22,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:22,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 470 [2024-11-19 05:44:22,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:23,609 INFO L124 PetriNetUnfolderBase]: 583/5262 cut-off events. [2024-11-19 05:44:23,610 INFO L125 PetriNetUnfolderBase]: For 1222/1354 co-relation queries the response was YES. [2024-11-19 05:44:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 5262 events. 583/5262 cut-off events. For 1222/1354 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 46682 event pairs, 50 based on Foata normal form. 10/4768 useless extension candidates. Maximal degree in co-relation 7652. Up to 424 conditions per place. [2024-11-19 05:44:23,650 INFO L140 encePairwiseOnDemand]: 463/470 looper letters, 34 selfloop transitions, 9 changer transitions 0/326 dead transitions. [2024-11-19 05:44:23,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 326 transitions, 1034 flow [2024-11-19 05:44:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:44:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 05:44:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2991 transitions. [2024-11-19 05:44:23,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9091185410334347 [2024-11-19 05:44:23,659 INFO L175 Difference]: Start difference. First operand has 277 places, 299 transitions, 883 flow. Second operand 7 states and 2991 transitions. [2024-11-19 05:44:23,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 326 transitions, 1034 flow [2024-11-19 05:44:23,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 326 transitions, 1034 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:44:23,669 INFO L231 Difference]: Finished difference. Result has 289 places, 307 transitions, 951 flow [2024-11-19 05:44:23,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=951, PETRI_PLACES=289, PETRI_TRANSITIONS=307} [2024-11-19 05:44:23,670 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -14 predicate places. [2024-11-19 05:44:23,671 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 307 transitions, 951 flow [2024-11-19 05:44:23,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:23,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:23,674 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:23,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:44:23,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1718529893, now seen corresponding path program 1 times [2024-11-19 05:44:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130224108] [2024-11-19 05:44:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:44:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:23,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130224108] [2024-11-19 05:44:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130224108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:23,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:44:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679217212] [2024-11-19 05:44:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:23,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 470 [2024-11-19 05:44:23,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 307 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:23,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:23,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 470 [2024-11-19 05:44:23,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:23,971 INFO L124 PetriNetUnfolderBase]: 62/832 cut-off events. [2024-11-19 05:44:23,971 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-11-19 05:44:23,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 832 events. 62/832 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2659 event pairs, 0 based on Foata normal form. 21/782 useless extension candidates. Maximal degree in co-relation 1053. Up to 54 conditions per place. [2024-11-19 05:44:23,978 INFO L140 encePairwiseOnDemand]: 465/470 looper letters, 13 selfloop transitions, 2 changer transitions 55/272 dead transitions. [2024-11-19 05:44:23,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 272 transitions, 776 flow [2024-11-19 05:44:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2024-11-19 05:44:23,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898581560283688 [2024-11-19 05:44:23,982 INFO L175 Difference]: Start difference. First operand has 289 places, 307 transitions, 951 flow. Second operand 3 states and 1267 transitions. [2024-11-19 05:44:23,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 272 transitions, 776 flow [2024-11-19 05:44:23,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 714 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-11-19 05:44:23,989 INFO L231 Difference]: Finished difference. Result has 275 places, 215 transitions, 543 flow [2024-11-19 05:44:23,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=275, PETRI_TRANSITIONS=215} [2024-11-19 05:44:23,990 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -28 predicate places. [2024-11-19 05:44:23,990 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 215 transitions, 543 flow [2024-11-19 05:44:23,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:23,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:23,991 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:23,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:44:23,992 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2096826464, now seen corresponding path program 1 times [2024-11-19 05:44:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598568914] [2024-11-19 05:44:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:44:24,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:24,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598568914] [2024-11-19 05:44:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598568914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:24,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:24,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:24,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362927992] [2024-11-19 05:44:24,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:24,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:24,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 470 [2024-11-19 05:44:24,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 215 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:24,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:24,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 470 [2024-11-19 05:44:24,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:24,265 INFO L124 PetriNetUnfolderBase]: 46/545 cut-off events. [2024-11-19 05:44:24,265 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-19 05:44:24,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 545 events. 46/545 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1383 event pairs, 8 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 635. Up to 60 conditions per place. [2024-11-19 05:44:24,269 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 16 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2024-11-19 05:44:24,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 214 transitions, 577 flow [2024-11-19 05:44:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2024-11-19 05:44:24,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943262411347518 [2024-11-19 05:44:24,273 INFO L175 Difference]: Start difference. First operand has 275 places, 215 transitions, 543 flow. Second operand 3 states and 1261 transitions. [2024-11-19 05:44:24,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 214 transitions, 577 flow [2024-11-19 05:44:24,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 540 flow, removed 3 selfloop flow, removed 15 redundant places. [2024-11-19 05:44:24,277 INFO L231 Difference]: Finished difference. Result has 218 places, 214 transitions, 508 flow [2024-11-19 05:44:24,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=218, PETRI_TRANSITIONS=214} [2024-11-19 05:44:24,278 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -85 predicate places. [2024-11-19 05:44:24,278 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 508 flow [2024-11-19 05:44:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:24,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:44:24,279 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:24,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:44:24,280 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_usbErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2024-11-19 05:44:24,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:44:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1992004148, now seen corresponding path program 1 times [2024-11-19 05:44:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:44:24,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595055502] [2024-11-19 05:44:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:44:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:44:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:44:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:44:24,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:44:24,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595055502] [2024-11-19 05:44:24,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595055502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:44:24,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:44:24,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:44:24,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156038045] [2024-11-19 05:44:24,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:44:24,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:44:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:44:24,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:44:24,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:44:24,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 470 [2024-11-19 05:44:24,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 214 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:24,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:44:24,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 470 [2024-11-19 05:44:24,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:44:24,470 INFO L124 PetriNetUnfolderBase]: 22/376 cut-off events. [2024-11-19 05:44:24,470 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-19 05:44:24,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 376 events. 22/376 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 453 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 384. Up to 19 conditions per place. [2024-11-19 05:44:24,473 INFO L140 encePairwiseOnDemand]: 467/470 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2024-11-19 05:44:24,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 536 flow [2024-11-19 05:44:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:44:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:44:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2024-11-19 05:44:24,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836879432624114 [2024-11-19 05:44:24,476 INFO L175 Difference]: Start difference. First operand has 218 places, 214 transitions, 508 flow. Second operand 3 states and 1246 transitions. [2024-11-19 05:44:24,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 536 flow [2024-11-19 05:44:24,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:44:24,480 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2024-11-19 05:44:24,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=470, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2024-11-19 05:44:24,480 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -86 predicate places. [2024-11-19 05:44:24,480 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2024-11-19 05:44:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:44:24,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2024-11-19 05:44:24,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2024-11-19 05:44:24,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2024-11-19 05:44:24,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2024-11-19 05:44:24,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 39 remaining) [2024-11-19 05:44:24,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2024-11-19 05:44:24,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2024-11-19 05:44:24,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2024-11-19 05:44:24,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2024-11-19 05:44:24,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2024-11-19 05:44:24,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2024-11-19 05:44:24,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2024-11-19 05:44:24,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2024-11-19 05:44:24,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2024-11-19 05:44:24,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2024-11-19 05:44:24,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2024-11-19 05:44:24,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork0Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 39 remaining) [2024-11-19 05:44:24,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:44:24,491 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:44:24,498 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:44:24,499 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:44:24,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:44:24 BasicIcfg [2024-11-19 05:44:24,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:44:24,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:44:24,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:44:24,505 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:44:24,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:44:16" (3/4) ... [2024-11-19 05:44:24,507 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:44:24,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_ath9k [2024-11-19 05:44:24,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_usb [2024-11-19 05:44:24,516 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 05:44:24,516 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:44:24,516 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:44:24,517 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:44:24,615 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:44:24,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:44:24,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:44:24,616 INFO L158 Benchmark]: Toolchain (without parser) took 10263.14ms. Allocated memory was 169.9MB in the beginning and 427.8MB in the end (delta: 257.9MB). Free memory was 118.0MB in the beginning and 257.5MB in the end (delta: -139.5MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,617 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:44:24,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1101.53ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 98.0MB in the end (delta: 19.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.79ms. Allocated memory is still 169.9MB. Free memory was 98.0MB in the beginning and 93.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,617 INFO L158 Benchmark]: Boogie Preprocessor took 44.20ms. Allocated memory is still 169.9MB. Free memory was 93.8MB in the beginning and 90.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,618 INFO L158 Benchmark]: RCFGBuilder took 779.36ms. Allocated memory is still 169.9MB. Free memory was 90.7MB in the beginning and 59.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,618 INFO L158 Benchmark]: TraceAbstraction took 8140.59ms. Allocated memory was 169.9MB in the beginning and 427.8MB in the end (delta: 257.9MB). Free memory was 58.2MB in the beginning and 262.8MB in the end (delta: -204.6MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,618 INFO L158 Benchmark]: Witness Printer took 111.32ms. Allocated memory is still 427.8MB. Free memory was 262.8MB in the beginning and 257.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:44:24,619 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1101.53ms. Allocated memory is still 169.9MB. Free memory was 117.7MB in the beginning and 98.0MB in the end (delta: 19.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.79ms. Allocated memory is still 169.9MB. Free memory was 98.0MB in the beginning and 93.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.20ms. Allocated memory is still 169.9MB. Free memory was 93.8MB in the beginning and 90.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 779.36ms. Allocated memory is still 169.9MB. Free memory was 90.7MB in the beginning and 59.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8140.59ms. Allocated memory was 169.9MB in the beginning and 427.8MB in the end (delta: 257.9MB). Free memory was 58.2MB in the beginning and 262.8MB in the end (delta: -204.6MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Witness Printer took 111.32ms. Allocated memory is still 427.8MB. Free memory was 262.8MB in the beginning and 257.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1777]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1778]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1783]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1780]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1784]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1790]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1792]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1793]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1771]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1748]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1772]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1756]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1764]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1758]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1752]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 477 locations, 39 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: 7.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1199 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 151 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=16, InterpolantAutomatonStates: 65, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1535 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 39/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:44:24,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE